Methods, apparatus, instructions, and logic to provide permute controls with leading zero count functionality

ABSTRACT

Instructions and logic provide SIMD permute controls with leading zero count functionality. Some embodiments include processors with a register with a plurality of data fields, each of the data fields to store a second plurality of bits. A destination register has corresponding data fields, each of these data fields to store a count of the number of most significant contiguous bits set to zero for corresponding data fields. Responsive to decoding a vector leading zero count instruction, execution units count the number of most significant contiguous bits set to zero for each of data fields in the register, and store the counts in corresponding data fields of the first destination register. Vector leading zero count instructions can be used to generate permute controls and completion masks to be used along with the set of permute controls, to resolve dependencies in gather-modify-scatter SIMD operations.

CROSS-REFERENCE TO RELATED APPLICATION

This application is related to: application Ser. No. 12/079,774, titled“Vector Instructions to Enable Efficient Synchronization and ParallelReduction Operations,” filed Oct. 1, 2009; application Ser. No.12/974,157, titled “Mechanism for Conflict Detection Using SIMD,” filedDec. 21, 2010; and application Ser. No. 12/976,616, titled “VectorConflict Instructions,” filed Dec. 22, 2010.

FIELD OF THE DISCLOSURE

The present disclosure pertains to the field of processing logic,microprocessors, and associated instruction set architecture that, whenexecuted by the processor or other processing logic, perform logical,mathematical, or other functional operations. In particular, thedisclosure relates to instructions and logic to provide SIMD permutecontrols with leading zero count functionality.

BACKGROUND OF THE DISCLOSURE

Modern processors often include instructions to provide operations thatare computationally intensive, but offer a high level of dataparallelism that can be exploited through an efficient implementationusing various data storage devices, such as for example,single-instruction multiple-data (SIMD) vector registers. In SIMDexecution, a single instruction operates on multiple data elementsconcurrently or simultaneously. This is typically implemented byextending the width of various resources such as registers andarithmetic logic units (ALUs), allowing them to hold or operate onmultiple data elements, respectively.

The central processing unit (CPU) may provide such parallel hardware tosupport the SIMD processing of vectors. A vector is a data structurethat holds a number of consecutive data elements. A vector register ofsize L may contain N vector elements of size M, where N=L/M. Forinstance, a 64-byte vector register may be partitioned into (a) 64vector elements, with each element holding a data item that occupies 1byte, (b) 32 vector elements to hold data items that occupy 2 bytes (orone “word”) each, (c) 16 vector elements to hold data items that occupy4 bytes (or one “doubleword”) each, or (d) 8 vector elements to holddata items that occupy 8 bytes (or one “quadword”) each.

A number of applications have large amounts of data-level parallelismand may be able to benefit from SIMD support. However, some applicationsspend a significant amount of time in operations on a set of sparselocations. Moreover, sometimes sequential operations are performed onthe same sparse locations and so these applications may see only limitedbenefit from SIMD, operations. To maintain SIMD efficiency, somearchitectures allow not only SIMD arithmetic operations but also SIMDmemory reads and writes (through gather and scatter operations). Scatterreductions are common operations in many applications. For example, ascatter-add operation can be used to enable multiple values of a firstarray to be reduced into (i.e., added to) selected elements of a secondarray according to a distribution of indices, which can often be random.But because of this, it may be difficult to efficiently process multipleelements concurrently (i.e., in SIMD mode). One concern is to ensurethat scalar program order is preserved when necessary. Another concernis to ensure that when data is scattered into memory, the resultingvector of memory addresses includes only unique addresses (i.e., thereare no duplicate addresses).

For example, histogram calculations are common operations in many imageprocessing applications. A histogram may be used to track thedistribution of color values of pixels in an image. However, updates tothe histogram array may be random, depending on input data to an array.In particular, indices of neighboring elements may point to the samehistogram bin. Accordingly, conflict detection and resolution isrequired to detect multiple dependent updates to the same locations andto ensure that scalar program order is preserved. This is precisely thekind of condition that can make it very difficult to process multipledata concurrently or simultaneously (i.e., using SIMD operations).

To date, potential solutions to such conflict concerns and relatedprocessing difficulties have not been adequately explored.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and notlimitation in the figures of the accompanying drawings.

FIG. 1A is a block diagram of one embodiment of a system that executesinstructions to provide SIMD permute controls with leading zero countfunctionality.

FIG. 1B is a block diagram of another embodiment of a system thatexecutes instructions to provide SIMD permute controls with leading zerocount functionality.

FIG. 1C is a block diagram of another embodiment of a system thatexecutes instructions to provide SIMD permute controls with leading zerocount functionality.

FIG. 2 is a block diagram of one embodiment of a processor that executesinstructions to provide SIMD permute controls with leading zero countfunctionality.

FIG. 3A illustrates packed data types according to one embodiment.

FIG. 3B illustrates packed data types according to one embodiment.

FIG. 3C illustrates packed data types according to one embodiment.

FIG. 3D illustrates an instruction encoding to provide SIMD permutecontrols with leading zero count functionality according to oneembodiment.

FIG. 3E illustrates an instruction encoding to provide SIMD permutecontrols with leading zero count functionality according to anotherembodiment.

FIG. 3F illustrates an instruction encoding to provide SIMD permutecontrols with leading zero count functionality according to anotherembodiment.

FIG. 3G illustrates an instruction encoding to provide SIMD permutecontrols with leading zero count functionality according to anotherembodiment.

FIG. 3H illustrates an instruction encoding to provide SIMD permutecontrols with leading zero count functionality according to anotherembodiment.

FIG. 4A illustrates elements of one embodiment of a processormicro-architecture to execute instructions that provide SIMD permutecontrols with leading zero count functionality.

FIG. 4B illustrates elements of another embodiment of a processormicro-architecture to execute instructions that provide SIMD permutecontrols with leading zero count functionality.

FIG. 5 is a block diagram of one embodiment of a processor to executeinstructions that provide SIMD permute controls with leading zero countfunctionality.

FIG. 6 is a block diagram of one embodiment of a computer system toexecute instructions that provide SIMD permute controls with leadingzero count functionality.

FIG. 7 is a block diagram of another embodiment of a computer system toexecute instructions that provide SIMD permute controls with leadingzero count functionality.

FIG. 8 is a block diagram of another embodiment of a computer system toexecute instructions that provide SIMD permute controls with leadingzero count functionality.

FIG. 9 is a block diagram of one embodiment of a system-on-a-chip toexecute instructions that provide SIMD permute controls with leadingzero count functionality.

FIG. 10 is a block diagram of an embodiment of a processor to executeinstructions that provide SIMD permute controls with leading zero countfunctionality.

FIG. 11 is a block diagram of one embodiment of an IP core developmentsystem that provides SIMD permute controls with leading zero countfunctionality.

FIG. 12 illustrates one embodiment of an architecture emulation systemthat provides SIMD permute controls with leading zero countfunctionality.

FIG. 13 illustrates one embodiment of a system to translate instructionsthat provide SIMD permute controls with leading zero countfunctionality.

FIG. 14A illustrates a flow diagram for one embodiment of an example ofusing an instruction to provide SIMD permute controls with leading zerocount functionality.

FIG. 14B illustrates a flow diagram for one embodiment of an example ofusing an instruction to provide SIMD vector address conflict detectionfunctionality.

FIG. 14C illustrates a flow diagram for one embodiment of an example ofusing an instruction to provide SIMD vector address conflict resolutionwith vector population count functionality.

FIG. 14D illustrates a flow diagram for an alternative embodiment of anexample of using combined instructions to provide efficient SIMD vectoraddress conflict resolution.

FIG. 15A illustrates a flow diagram for one embodiment of a process toprovide SIMD permute controls with leading zero count functionality.

FIG. 15B illustrates a flow diagram for one embodiment of a process toprovide SIMD vector address conflict detection functionality.

FIG. 15C illustrates a flow diagram for one embodiment of a process toprovide SIMD vector address conflict resolution with vector populationcount functionality.

FIG. 15D illustrates a flow diagram for an alternative embodiment of acombined process to provide efficient SIMD vector address conflictresolution.

FIG. 16 illustrates an embodiment of an apparatus for executing aninstruction to provide SIMD vector leading zero count functionalityuseful for generating permute controls for efficient vector addressconflict resolution.

FIG. 17 illustrates an embodiment of an apparatus for executing aninstruction to provide SIMD vector address conflict detectionfunctionality for efficient vector address conflict resolution.

FIG. 18 illustrates an embodiment of an apparatus for executing aninstruction to provide SIMD vector population count functionality forefficient vector address conflict resolution.

DETAILED DESCRIPTION

The following description discloses instructions and processing logic toprovide SIMD permute controls with leading zero count functionalitywithin or in association with a processor, computer system, or otherprocessing apparatus. Instructions and logic are disclosed herein toprovide SIMD permute controls with leading zero count functionality.Some embodiments include processors with a register with a plurality ofdata fields, each of the data fields to store a second plurality ofbits. A destination register has corresponding data fields, each ofthese data fields to store a count of the number of most significantcontiguous bits set to zero for corresponding data fields. Responsive todecoding a vector leading zero count instruction, execution units countthe number of most significant contiguous bits set to zero for each ofdata fields in the register, and store the counts in corresponding datafields of the first destination register. Vector leading zero countinstructions can be used to generate permute controls and completionmasks to be used along with the set of permute controls, to resolvedependencies in gather-modify-scatter SIMD operations.

The following description discloses a number of instructions, methodsand processing logic to resolve dependencies in gather-modify-scatterSIMD operations. It will be appreciated that SIMD vector conflictinstructions, as in the embodiments described herein, may be used forvariable sized elements and memory offsets to provide SIMD vectoraddress conflict detection functionality and to generate conflict masksfor efficient SIMD address conflict resolution. It will also beappreciated that SIMD vector leading zero count instructions, as in theembodiments described herein, may be used with variable sized elementsand conflict masks to provide SIMD permute controls, which will bedescribed in greater detail below, thereby permitting more efficientSIMD address conflict resolution in registers without performingdependent computations through memory. It will further be appreciatedthat SIMD vector population count instructions, as in the embodimentsdescribed herein, may be used with variable sized elements and conflictmasks to efficiently compute iteration counts and to provide SIMDcompletion masks for each iteration of a SIMD address conflictresolution, which will be described in greater detail below. Thus theinstructions and logic disclosed herein provide for more efficient SIMDaddress conflict resolution especially in gather-modify-scatterapplications.

In the following description, numerous specific details such asprocessing logic, processor types, micro-architectural conditions,events, enablement mechanisms, and the like are set forth in order toprovide a more thorough understanding of embodiments of the presentinvention. It will be appreciated, however, by one skilled in the artthat the invention may be practiced without such specific details.Additionally, some well known structures, circuits, and the like havenot been shown in detail to avoid unnecessarily obscuring embodiments ofthe present invention.

Although the following embodiments are described with reference to aprocessor, other embodiments are applicable to other types of integratedcircuits and logic devices. Similar techniques and teachings ofembodiments of the present invention can be applied to other types ofcircuits or semiconductor devices that can benefit from higher pipelinethroughput and improved performance. The teachings of embodiments of thepresent invention are applicable to any processor or machine thatperforms data manipulations. However, the present invention is notlimited to processors or machines that perform 512 bit, 256 bit, 128bit, 64 bit, 32 bit, or 16 bit data operations and can be applied to anyprocessor and machine in which manipulation or management of data isperformed. In addition, the following description provides examples, andthe accompanying drawings show various examples for the purposes ofillustration. However, these examples should not be construed in alimiting sense as they are merely intended to provide examples ofembodiments of the present invention rather than to provide anexhaustive list of all possible implementations of embodiments of thepresent invention.

Although the below examples describe instruction handling anddistribution in the context of execution units and logic circuits, otherembodiments of the present invention can be accomplished by way of dataand/or instructions stored on a machine-readable, tangible medium, whichwhen performed by a machine cause the machine to perform functionsconsistent with at least one embodiment of the invention. In oneembodiment, functions associated with embodiments of the presentinvention are embodied in machine-executable instructions. Theinstructions can be used to cause a general-purpose or special-purposeprocessor that is programmed with the instructions to perform the stepsof the present invention. Embodiments of the present invention may beprovided as a computer program product or software which may include amachine or computer-readable medium having stored thereon instructionswhich may be used to program a computer (or other electronic devices) toperform one or more operations according to embodiments of the presentinvention. Alternatively, steps of embodiments of the present inventionmight be performed by specific hardware components that containfixed-function logic for performing the steps, or by any combination ofprogrammed computer components and fixed-function hardware components.

Instructions used to program logic to perform embodiments of theinvention can be stored within a memory in the system, such as DRAM,cache, flash memory, or other storage. Furthermore, the instructions canbe distributed via a network or by way of other computer readable media.Thus a machine-readable medium may include any mechanism for storing ortransmitting information in a form readable by a machine (e.g., acomputer), but is not limited to, floppy diskettes, optical disks,Compact Disc, Read-Only Memory (CD-ROMs), and magneto-optical disks,Read-Only Memory (ROMs), Random Access Memory (RAM), ErasableProgrammable Read-Only Memory (EPROM), Electrically ErasableProgrammable Read-Only Memory (EEPROM), magnetic or optical cards, flashmemory, or a tangible, machine-readable storage used in the transmissionof information over the Internet via electrical, optical, acoustical orother forms of propagated signals (e.g., carrier waves, infraredsignals, digital signals, etc.). Accordingly, the computer-readablemedium includes any type of tangible machine-readable medium suitablefor storing or transmitting electronic instructions or information in aform readable by a machine (e.g., a computer).

A design may go through various stages, from creation to simulation tofabrication. Data representing a design may represent the design in anumber of manners. First, as is useful in simulations, the hardware maybe represented using a hardware description language or anotherfunctional description language. Additionally, a circuit level modelwith logic and/or transistor gates may be produced at some stages of thedesign process. Furthermore, most designs, at some stage, reach a levelof data representing the physical placement of various devices in thehardware model. In the case where conventional semiconductor fabricationtechniques are used, the data representing the hardware model may be thedata specifying the presence or absence of various features on differentmask layers for masks used to produce the integrated circuit. In anyrepresentation of the design, the data may be stored in any form of amachine readable medium. A memory or a magnetic or optical storage suchas a disc may be the machine readable medium to store informationtransmitted via optical or electrical wave modulated or otherwisegenerated to transmit such information. When an electrical carrier waveindicating or carrying the code or design is transmitted, to the extentthat copying, buffering, or re-transmission of the electrical signal isperformed, a new copy is made. Thus, a communication provider or anetwork provider may store on a tangible, machine-readable medium, atleast temporarily, an article, such as information encoded into acarrier wave, embodying techniques of embodiments of the presentinvention.

In modern processors, a number of different execution units are used toprocess and execute a variety of code and instructions. Not allinstructions are created equal as some are quicker to complete whileothers can take a number of clock cycles to complete. The faster thethroughput of instructions, the better the overall performance of theprocessor. Thus it would be advantageous to have as many instructionsexecute as fast as possible. However, there are certain instructionsthat have greater complexity and require more in terms of execution timeand processor resources. For example, there are floating pointinstructions, load/store operations, data moves, etc.

As more computer systems are used in internet, text, and multimediaapplications, additional processor support has been introduced overtime. In one embodiment, an instruction set may be associated with oneor more computer architectures, including data types, instructions,register architecture, addressing modes, memory architecture, interruptand exception handling, and external input and output (I/O).

In one embodiment, the instruction set architecture (ISA) may beimplemented by one or more micro-architectures, which includes processorlogic and circuits used to implement one or more instruction sets.Accordingly, processors with different micro-architectures can share atleast a portion of a common instruction set. For example, Intel® Pentium4 processors, Intel® Core™ processors, and processors from AdvancedMicro Devices, Inc. of Sunnyvale Calif. implement nearly identicalversions of the x86 instruction set (with some extensions that have beenadded with newer versions), but have different internal designs.Similarly, processors designed by other processor development companies,such as ARM Holdings, Ltd., MIPS, or their licensees or adopters, mayshare at least a portion a common instruction set, but may includedifferent processor designs. For example, the same register architectureof the ISA may be implemented in different ways in differentmicro-architectures using new or well-known techniques, includingdedicated physical registers, one or more dynamically allocated physicalregisters using a register renaming mechanism (e.g., the use of aRegister Alias Table (RAT), a Reorder Buffer (ROB) and a retirementregister file. In one embodiment, registers may include one or moreregisters, register architectures, register files, or other registersets that may or may not be addressable by a software programmer.

In one embodiment, an instruction may include one or more instructionformats. In one embodiment, an instruction format may indicate variousfields (number of bits, location of bits, etc.) to specify, among otherthings, the operation to be performed and the operand(s) on which thatoperation is to be performed. Some instruction formats may be furtherbroken defined by instruction templates (or sub formats). For example,the instruction templates of a given instruction format may be definedto have different subsets of the instruction format's fields and/ordefined to have a given field interpreted differently. In oneembodiment, an instruction is expressed using an instruction format(and, if defined, in a given one of the instruction templates of thatinstruction format) and specifies or indicates the operation and theoperands upon which the operation will operate.

Scientific, financial, auto-vectorized general purpose, RMS(recognition, mining, and synthesis), and visual and multimediaapplications (e.g., 2D/3D graphics, image processing, videocompression/decompression, voice recognition algorithms and audiomanipulation) may require the same operation to be performed on a largenumber of data items. In one embodiment, Single Instruction MultipleData (SIMD) refers to a type of instruction that causes a processor toperform an operation on multiple data elements. SIMD technology may beused in processors that can logically divide the bits in a register intoa number of fixed-sized or variable-sized data elements, each of whichrepresents a separate value. For example, in one embodiment, the bits ina 64-bit register may be organized as a source operand containing fourseparate 16-bit data elements, each of which represents a separate16-bit value. This type of data may be referred to as ‘packed’ data typeor ‘vector’ data type, and operands of this data type are referred to aspacked data operands or vector operands. In one embodiment, a packeddata item or vector may be a sequence of packed data elements storedwithin a single register, and a packed data operand or a vector operandmay a source or destination operand of a SIMD instruction (or ‘packeddata instruction’ or a ‘vector instruction’). In one embodiment, a SIMDinstruction specifies a single vector operation to be performed on twosource vector operands to generate a destination vector operand (alsoreferred to as a result vector operand) of the same or different size,with the same or different number of data elements, and in the same ordifferent data element order.

SIMD technology, such as that employed by the Intel® Core™ processorshaving an instruction set including x86, MMX™, Streaming SIMD Extensions(SSE), SSE2, SSE3, SSE4.1, and SSE4.2 instructions, ARM processors, suchas the ARM Cortex® family of processors having an instruction setincluding the Vector Floating Point (VFP) and/or NEON instructions, andMIPS processors, such as the Loongson family of processors developed bythe Institute of Computing Technology (ICT) of the Chinese Academy ofSciences, has enabled a significant improvement in applicationperformance (Core™ and MMX™ are registered trademarks or trademarks ofIntel Corporation of Santa Clara, Calif.).

In one embodiment, destination and source registers/data are genericterms to represent the source and destination of the corresponding dataor operation. In some embodiments, they may be implemented by registers,memory, or other storage areas having other names or functions thanthose depicted. For example, in one embodiment, “DEST1” may be atemporary storage register or other storage area, whereas “SRC1” and“SRC2” may be a first and second source storage register or otherstorage area, and so forth. In other embodiments, two or more of the SRCand DEST storage areas may correspond to different data storage elementswithin the same storage area (e.g., a SIMD register). In one embodiment,one of the source registers may also act as a destination register by,for example, writing back the result of an operation performed on thefirst and second source data to one of the two source registers servingas a destination registers.

FIG. 1A is a block diagram of an exemplary computer system formed with aprocessor that includes execution units to execute an instruction inaccordance with one embodiment of the present invention. System 100includes a component, such as a processor 102 to employ execution unitsincluding logic to perform algorithms for process data, in accordancewith the present invention, such as in the embodiment described herein.System 100 is representative of processing systems based on the PENTIUM®III, PENTIUM® 4, Xeon™, Itanium®, XScale™ and/or StrongARM™microprocessors available from Intel Corporation of Santa Clara, Calif.,although other systems (including PCs having other microprocessors,engineering workstations, set-top boxes and the like) may also be used.In one embodiment, sample system 100 may execute a version of theWINDOWS™ operating system available from Microsoft Corporation ofRedmond, Wash., although other operating systems (UNIX and Linux forexample), embedded software, and/or graphical user interfaces, may alsobe used. Thus, embodiments of the present invention are not limited toany specific combination of hardware circuitry and software.

Embodiments are not limited to computer systems. Alternative embodimentsof the present invention can be used in other devices such as handhelddevices and embedded applications. Some examples of handheld devicesinclude cellular phones, Internet Protocol devices, digital cameras,personal digital assistants (PDAs), and handheld PCs. Embeddedapplications can include a micro controller, a digital signal processor(DSP), system on a chip, network computers (NetPC), set-top boxes,network hubs, wide area network (WAN) switches, or any other system thatcan perform one or more instructions in accordance with at least oneembodiment.

FIG. 1A is a block diagram of a computer system 100 formed with aprocessor 102 that includes one or more execution units 108 to performan algorithm to perform at least one instruction in accordance with oneembodiment of the present invention. One embodiment may be described inthe context of a single processor desktop or server system, butalternative embodiments can be included in a multiprocessor system.System 100 is an example of a ‘hub’ system architecture. The computersystem 100 includes a processor 102 to process data signals. Theprocessor 102 can be a complex instruction set computer (CISC)microprocessor, a reduced instruction set computing (RISC)microprocessor, a very long instruction word (VLIW) microprocessor, aprocessor implementing a combination of instruction sets, or any otherprocessor device, such as a digital signal processor, for example. Theprocessor 102 is coupled to a processor bus 110 that can transmit datasignals between the processor 102 and other components in the system100. The elements of system 100 perform their conventional functionsthat are well known to those familiar with the art.

In one embodiment, the processor 102 includes a Level 1 (L1) internalcache memory 104. Depending on the architecture, the processor 102 canhave a single internal cache or multiple levels of internal cache.Alternatively, in another embodiment, the cache memory can resideexternal to the processor 102. Other embodiments can also include acombination of both internal and external caches depending on theparticular implementation and needs. Register file 106 can storedifferent types of data in various registers including integerregisters, floating point registers, status registers, and instructionpointer register.

Execution unit 108, including logic to perform integer and floatingpoint operations, also resides in the processor 102. The processor 102also includes a microcode (ucode) ROM that stores microcode for certainmacroinstructions. For one embodiment, execution unit 108 includes logicto handle a packed instruction set 109. By including the packedinstruction set 109 in the instruction set of a general-purposeprocessor 102, along with associated circuitry to execute theinstructions, the operations used by many multimedia applications may beperformed using packed data in a general-purpose processor 102. Thus,many multimedia applications can be accelerated and executed moreefficiently by using the full width of a processor's data bus forperforming operations on packed data. This can eliminate the need totransfer smaller units of data across the processor's data bus toperform one or more operations one data element at a time.

Alternate embodiments of an execution unit 108 can also be used in microcontrollers, embedded processors, graphics devices, DSPs, and othertypes of logic circuits. System 100 includes a memory 120. Memory 120can be a dynamic random access memory (DRAM) device, a static randomaccess memory (SRAM) device, flash memory device, or other memorydevice. Memory 120 can store instructions and/or data represented bydata signals that can be executed by the processor 102.

A system logic chip 116 is coupled to the processor bus 110 and memory120. The system logic chip 116 in the illustrated embodiment is a memorycontroller hub (MCH). The processor 102 can communicate to the MCH 116via a processor bus 110. The MCH 116 provides a high bandwidth memorypath 118 to memory 120 for instruction and data storage and for storageof graphics commands, data and textures. The MCH 116 is to direct datasignals between the processor 102, memory 120, and other components inthe system 100 and to bridge the data signals between processor bus 110,memory 120, and system I/O 122. In some embodiments, the system logicchip 116 can provide a graphics port for coupling to a graphicscontroller 112. The MCH 116 is coupled to memory 120 through a memoryinterface 118. The graphics card 112 is coupled to the MCH 116 throughan Accelerated Graphics Port (AGP) interconnect 114.

System 100 uses a proprietary hub interface bus 122 to couple the MCH116 to the I/O controller hub (ICH) 130. The ICH 130 provides directconnections to some I/O devices via a local I/O bus. The local I/O busis a high-speed I/O bus for connecting peripherals to the memory 120,chipset, and processor 102. Some examples are the audio controller,firmware hub (flash BIOS) 128, wireless transceiver 126, data storage124, legacy I/O controller containing user input and keyboardinterfaces, a serial expansion port such as Universal Serial Bus (USB),and a network controller 134. The data storage device 124 can comprise ahard disk drive, a floppy disk drive, a CD-ROM device, a flash memorydevice, or other mass storage device.

For another embodiment of a system, an instruction in accordance withone embodiment can be used with a system on a chip. One embodiment of asystem on a chip comprises of a processor and a memory. The memory forone such system is a flash memory. The flash memory can be located onthe same die as the processor and other system components. Additionally,other logic blocks such as a memory controller or graphics controllercan also be located on a system on a chip.

FIG. 1B illustrates a data processing system 140 which implements theprinciples of one embodiment of the present invention. It will bereadily appreciated by one of skill in the art that the embodimentsdescribed herein can be used with alternative processing systems withoutdeparture from the scope of embodiments of the invention.

Computer system 140 comprises a processing core 159 capable ofperforming at least one instruction in accordance with one embodiment.For one embodiment, processing core 159 represents a processing unit ofany type of architecture, including but not limited to a CISC, a RISC ora VLIW type architecture. Processing core 159 may also be suitable formanufacture in one or more process technologies and by being representedon a machine readable media in sufficient detail, may be suitable tofacilitate said manufacture.

Processing core 159 comprises an execution unit 142, a set of registerfile(s) 145, and a decoder 144. Processing core 159 also includesadditional circuitry (not shown) which is not necessary to theunderstanding of embodiments of the present invention. Execution unit142 is used for executing instructions received by processing core 159.In addition to performing typical processor instructions, execution unit142 can perform instructions in packed instruction set 143 forperforming operations on packed data formats. Packed instruction set 143includes instructions for performing embodiments of the invention andother packed instructions. Execution unit 142 is coupled to registerfile 145 by an internal bus. Register file 145 represents a storage areaon processing core 159 for storing information, including data. Aspreviously mentioned, it is understood that the storage area used forstoring the packed data is not critical. Execution unit 142 is coupledto decoder 144. Decoder 144 is used for decoding instructions receivedby processing core 159 into control signals and/or microcode entrypoints. In response to these control signals and/or microcode entrypoints, execution unit 142 performs the appropriate operations. In oneembodiment, the decoder is used to interpret the opcode of theinstruction, which will indicate what operation should be performed onthe corresponding data indicated within the instruction.

Processing core 159 is coupled with bus 141 for communicating withvarious other system devices, which may include but are not limited to,for example, synchronous dynamic random access memory (SDRAM) control146, static random access memory (SRAM) control 147, burst flash memoryinterface 148, personal computer memory card international association(PCMCIA)/compact flash (CF) card control 149, liquid crystal display(LCD) control 150, direct memory access (DMA) controller 151, andalternative bus master interface 152. In one embodiment, data processingsystem 140 may also comprise an I/O bridge 154 for communicating withvarious I/O devices via an I/O bus 153. Such I/O devices may include butare not limited to, for example, universal asynchronousreceiver/transmitter (UART) 155, universal serial bus (USB) 156,Bluetooth wireless UART 157 and I/O expansion interface 158.

One embodiment of data processing system 140 provides for mobile,network and/or wireless communications and a processing core 159 capableof performing SIMD operations including a text string comparisonoperation. Processing core 159 may be programmed with various audio,video, imaging and communications algorithms including discretetransformations such as a Walsh-Hadamard transform, a fast Fouriertransform (FFT), a discrete cosine transform (DCT), and their respectiveinverse transforms; compression/decompression techniques such as colorspace transformation, video encode motion estimation or video decodemotion compensation; and modulation/demodulation (MODEM) functions suchas pulse coded modulation (PCM).

FIG. 1C illustrates another alternative embodiments of a data processingsystem capable of executing instructions to provide SIMD permutecontrols with leading zero count functionality. In accordance with onealternative embodiment, data processing system 160 may include a mainprocessor 166, a SIMD coprocessor 161, a cache memory 167, and aninput/output system 168. The input/output system 168 may optionally becoupled to a wireless interface 169. SIMD coprocessor 161 is capable ofperforming operations including instructions in accordance with oneembodiment. Processing core 170 may be suitable for manufacture in oneor more process technologies and by being represented on a machinereadable media in sufficient detail, may be suitable to facilitate themanufacture of all or part of data processing system 160 includingprocessing core 170.

For one embodiment, SIMD coprocessor 161 comprises an execution unit 162and a set of register file(s) 164. One embodiment of main processor 166comprises a decoder 165 to recognize instructions of instruction set 163including instructions in accordance with one embodiment for executionby execution unit 162. For alternative embodiments, SIMD coprocessor 161also comprises at least part of decoder 165B to decode instructions ofinstruction set 163. Processing core 170 also includes additionalcircuitry (not shown) which is not necessary to the understanding ofembodiments of the present invention.

In operation, the main processor 166 executes a stream of dataprocessing instructions that control data processing operations of ageneral type including interactions with the cache memory 167, and theinput/output system 168. Embedded within the stream of data processinginstructions are SIMD coprocessor instructions. The decoder 165 of mainprocessor 166 recognizes these SIMD coprocessor instructions as being ofa type that should be executed by an attached SIMD coprocessor 161.Accordingly, the main processor 166 issues these SIMD coprocessorinstructions (or control signals representing SIMD coprocessorinstructions) on the coprocessor bus 171 where from they are received byany attached SIMD coprocessors. In this case, the SIMD coprocessor 161will accept and execute any received SIMD coprocessor instructionsintended for it.

Data may be received via wireless interface 169 for processing by theSIMD coprocessor instructions. For one example, voice communication maybe received in the form of a digital signal, which may be processed bythe SIMD coprocessor instructions to regenerate digital audio samplesrepresentative of the voice communications. For another example,compressed audio and/or video may be received in the form of a digitalbit stream, which may be processed by the SIMD coprocessor instructionsto regenerate digital audio samples and/or motion video frames. For oneembodiment of processing core 170, main processor 166, and a SIMDcoprocessor 161 are integrated into a single processing core 170comprising an execution unit 162, a set of register file(s) 164, and adecoder 165 to recognize instructions of instruction set 163 includinginstructions in accordance with one embodiment.

FIG. 2 is a block diagram of the micro-architecture for a processor 200that includes logic circuits to perform instructions in accordance withone embodiment of the present invention. In some embodiments, aninstruction in accordance with one embodiment can be implemented tooperate on data elements having sizes of byte, word, doubleword,quadword, etc., as well as datatypes, such as single and doubleprecision integer and floating point datatypes. In one embodiment thein-order front end 201 is the part of the processor 200 that fetchesinstructions to be executed and prepares them to be used later in theprocessor pipeline. The front end 201 may include several units. In oneembodiment, the instruction prefetcher 226 fetches instructions frommemory and feeds them to an instruction decoder 228 which in turndecodes or interprets them. For example, in one embodiment, the decoderdecodes a received instruction into one or more operations called“micro-instructions” or “micro-operations” (also called micro op oruops) that the machine can execute. In other embodiments, the decoderparses the instruction into an opcode and corresponding data and controlfields that are used by the micro-architecture to perform operations inaccordance with one embodiment. In one embodiment, the trace cache 230takes decoded uops and assembles them into program ordered sequences ortraces in the uop queue 234 for execution. When the trace cache 230encounters a complex instruction, the microcode ROM 232 provides theuops needed to complete the operation.

Some instructions are converted into a single micro-op, whereas othersneed several micro-ops to complete the full operation. In oneembodiment, if more than four micro-ops are needed to complete ainstruction, the decoder 228 accesses the microcode ROM 232 to do theinstruction. For one embodiment, an instruction can be decoded into asmall number of micro ops for processing at the instruction decoder 228.In another embodiment, an instruction can be stored within the microcodeROM 232 should a number of micro-ops be needed to accomplish theoperation. The trace cache 230 refers to a entry point programmablelogic array (PLA) to determine a correct micro-instruction pointer forreading the micro-code sequences to complete one or more instructions inaccordance with one embodiment from the micro-code ROM 232. After themicrocode ROM 232 finishes sequencing micro-ops for an instruction, thefront end 201 of the machine resumes fetching micro-ops from the tracecache 230.

The out-of-order execution engine 203 is where the instructions areprepared for execution. The out-of-order execution logic has a number ofbuffers to smooth out and re-order the flow of instructions to optimizeperformance as they go down the pipeline and get scheduled forexecution. The allocator logic allocates the machine buffers andresources that each uop needs in order to execute. The register renaminglogic renames logic registers onto entries in a register file. Theallocator also allocates an entry for each uop in one of the two uopqueues, one for memory operations and one for non-memory operations, infront of the instruction schedulers: memory scheduler, fast scheduler202, slow/general floating point scheduler 204, and simple floatingpoint scheduler 206. The uop schedulers 202, 204, 206, determine when auop is ready to execute based on the readiness of their dependent inputregister operand sources and the availability of the execution resourcesthe uops need to complete their operation. The fast scheduler 202 of oneembodiment can schedule on each half of the main clock cycle while theother schedulers can only schedule once per main processor clock cycle.The schedulers arbitrate for the dispatch ports to schedule uops forexecution.

Register files 208, 210, sit between the schedulers 202, 204, 206, andthe execution units 212, 214, 216, 218, 220, 222, 224 in the executionblock 211. There is a separate register file 208, 210, for integer andfloating point operations, respectively. Each register file 208, 210, ofone embodiment also includes a bypass network that can bypass or forwardjust completed results that have not yet been written into the registerfile to new dependent uops. The integer register file 208 and thefloating point register file 210 are also capable of communicating datawith the other. For one embodiment, the integer register file 208 issplit into two separate register files, one register file for the loworder 32 bits of data and a second register file for the high order 32bits of data. The floating point register file 210 of one embodiment has128 bit wide entries because floating point instructions typically haveoperands from 64 to 128 bits in width.

The execution block 211 contains the execution units 212, 214, 216, 218,220, 222, 224, where the instructions are actually executed. Thissection includes the register files 208, 210, that store the integer andfloating point data operand values that the micro-instructions need toexecute. The processor 200 of one embodiment is comprised of a number ofexecution units: address generation unit (AGU) 212, AGU 214, fast ALU216, fast ALU 218, slow ALU 220, floating point ALU 222, floating pointmove unit 224. For one embodiment, the floating point execution blocks222, 224, execute floating point, MMX, SIMD, and SSE, or otheroperations. The floating point ALU 222 of one embodiment includes a 64bit by 64 bit floating point divider to execute divide, square root, andremainder micro-ops. For embodiments of the present invention,instructions involving a floating point value may be handled with thefloating point hardware. In one embodiment, the ALU operations go to thehigh-speed ALU execution units 216, 218. The fast ALUs 216, 218, of oneembodiment can execute fast operations with an effective latency of halfa clock cycle. For one embodiment, most complex integer operations go tothe slow ALU 220 as the slow ALU 220 includes integer execution hardwarefor long latency type of operations, such as a multiplier, shifts, flaglogic, and branch processing. Memory load/store operations are executedby the AGUs 212, 214. For one embodiment, the integer ALUs 216, 218,220, are described in the context of performing integer operations on 64bit data operands. In alternative embodiments, the ALUs 216, 218, 220,can be implemented to support a variety of data bits including 16, 32,128, 256, etc. Similarly, the floating point units 222, 224, can beimplemented to support a range of operands having bits of variouswidths. For one embodiment, the floating point units 222, 224, canoperate on 128 bits wide packed data operands in conjunction with SIMDand multimedia instructions.

In one embodiment, the uops schedulers 202, 204, 206, dispatch dependentoperations before the parent load has finished executing. As uops arespeculatively scheduled and executed in processor 200, the processor 200also includes logic to handle memory misses. If a data load misses inthe data cache, there can be dependent operations in flight in thepipeline that have left the scheduler with temporarily incorrect data. Areplay mechanism tracks and re-executes instructions that use incorrectdata. Only the dependent operations need to be replayed and theindependent ones are allowed to complete. The schedulers and replaymechanism of one embodiment of a processor are also designed to catchinstructions that provide SIMD permute controls with leading zero countfunctionality.

The term “registers” may refer to the on-board processor storagelocations that are used as part of instructions to identify operands. Inother words, registers may be those that are usable from the outside ofthe processor (from a programmer's perspective). However, the registersof an embodiment should not be limited in meaning to a particular typeof circuit. Rather, a register of an embodiment is capable of storingand providing data, and performing the functions described herein. Theregisters described herein can be implemented by circuitry within aprocessor using any number of different techniques, such as dedicatedphysical registers, dynamically allocated physical registers usingregister renaming, combinations of dedicated and dynamically allocatedphysical registers, etc. In one embodiment, integer registers storethirty-two bit integer data. A register file of one embodiment alsocontains eight multimedia SIMD registers for packed data. For thediscussions below, the registers are understood to be data registersdesigned to hold packed data, such as 64 bits wide MMX™ registers (alsoreferred to as ‘mm’ registers in some instances) in microprocessorsenabled with MMX technology from Intel Corporation of Santa Clara,Calif. These MMX registers, available in both integer and floating pointforms, can operate with packed data elements that accompany SIMD and SSEinstructions. Similarly, 128 bits wide XMM registers relating to SSE2,SSE3, SSE4, or beyond (referred to generically as “SSEx”) technology canalso be used to hold such packed data operands. In one embodiment, instoring packed data and integer data, the registers do not need todifferentiate between the two data types. In one embodiment, integer andfloating point are either contained in the same register file ordifferent register files. Furthermore, in one embodiment, floating pointand integer data may be stored in different registers or the sameregisters.

In the examples of the following figures, a number of data operands aredescribed. FIG. 3A illustrates various packed data type representationsin multimedia registers according to one embodiment of the presentinvention. FIG. 3A illustrates data types for a packed byte 310, apacked word 320, and a packed doubleword (dword) 330 for 128 bits wideoperands. The packed byte format 310 of this example is 128 bits longand contains sixteen packed byte data elements. A byte is defined hereas 8 bits of data. Information for each byte data element is stored inbit 7 through bit 0 for byte 0, bit 15 through bit 8 for byte 1, bit 23through bit 16 for byte 2, and finally bit 120 through bit 127 for byte15. Thus, all available bits are used in the register. This storagearrangement increases the storage efficiency of the processor. As well,with sixteen data elements accessed, one operation can now be performedon sixteen data elements in parallel.

Generally, a data element is an individual piece of data that is storedin a single register or memory location with other data elements of thesame length. In packed data sequences relating to SSEx technology, thenumber of data elements stored in a XMM register is 128 bits divided bythe length in bits of an individual data element. Similarly, in packeddata sequences relating to MMX and SSE technology, the number of dataelements stored in an MMX register is 64 bits divided by the length inbits of an individual data element. Although the data types illustratedin FIG. 3A are 128 bit long, embodiments of the present invention canalso operate with 64 bit wide, 256 bit wide, 512 bit wide, or othersized operands. The packed word format 320 of this example is 128 bitslong and contains eight packed word data elements. Each packed wordcontains sixteen bits of information. The packed doubleword format 330of FIG. 3A is 128 bits long and contains four packed doubleword dataelements. Each packed doubleword data element contains thirty two bitsof information. A packed quadword is 128 bits long and contains twopacked quad-word data elements.

FIG. 3B illustrates alternative in-register data storage formats. Eachpacked data can include more than one independent data element. Threepacked data formats are illustrated; packed half 341, packed single 342,and packed double 343. One embodiment of packed half 341, packed single342, and packed double 343 contain fixed-point data elements. For analternative embodiment one or more of packed half 341, packed single342, and packed double 343 may contain floating-point data elements. Onealternative embodiment of packed half 341 is one hundred twenty-eightbits long containing eight 16-bit data elements. One embodiment ofpacked single 342 is one hundred twenty-eight bits long and containsfour 32-bit data elements. One embodiment of packed double 343 is onehundred twenty-eight bits long and contains two 64-bit data elements. Itwill be appreciated that such packed data formats may be furtherextended to other register lengths, for example, to 96-bits, 160-bits,192-bits, 224-bits, 256-bits, 512-bits or more.

FIG. 3C illustrates various signed and unsigned packed data typerepresentations in multimedia registers according to one embodiment ofthe present invention. Unsigned packed byte representation 344illustrates the storage of an unsigned packed byte in a SIMD register.Information for each byte data element is stored in bit seven throughbit zero for byte zero, bit fifteen through bit eight for byte one, bittwenty-three through bit sixteen for byte two, etc., and finally bit onehundred twenty through bit one hundred twenty-seven for byte fifteen.Thus, all available bits are used in the register. This storagearrangement can increase the storage efficiency of the processor. Aswell, with sixteen data elements accessed, one operation can now beperformed on sixteen data elements in a parallel fashion. Signed packedbyte representation 345 illustrates the storage of a signed packed byte.Note that the eighth bit of every byte data element is the signindicator. Unsigned packed word representation 346 illustrates how wordseven through word zero are stored in a SIMD register. Signed packedword representation 347 is similar to the unsigned packed wordin-register representation 346. Note that the sixteenth bit of each worddata element is the sign indicator. Unsigned packed doublewordrepresentation 348 shows how doubleword data elements are stored. Signedpacked doubleword representation 349 is similar to unsigned packeddoubleword in-register representation 348. Note that the necessary signbit is the thirty-second bit of each doubleword data element.

FIG. 3D is a depiction of one embodiment of an operation encoding(opcode) format 360, having thirty-two or more bits, and register/memoryoperand addressing modes corresponding with a type of opcode formatdescribed in the “Intel® 64 and IA-32 Intel Architecture SoftwareDeveloper's Manual Combined Volumes 2A and 2B: Instruction Set ReferenceA-Z,” which is which is available from Intel Corporation, Santa Clara,Calif. on the world-wide-web (www) atintel.com/products/processor/manuals/. In one embodiment, andinstruction may be encoded by one or more of fields 361 and 362. Up totwo operand locations per instruction may be identified, including up totwo source operand identifiers 364 and 365. For one embodiment,destination operand identifier 366 is the same as source operandidentifier 364, whereas in other embodiments they are different. For analternative embodiment, destination operand identifier 366 is the sameas source operand identifier 365, whereas in other embodiments they aredifferent. In one embodiment, one of the source operands identified bysource operand identifiers 364 and 365 is overwritten by the results ofthe instruction, whereas in other embodiments identifier 364 correspondsto a source register element and identifier 365 corresponds to adestination register element. For one embodiment, operand identifiers364 and 365 may be used to identify 32-bit or 64-bit source anddestination operands.

FIG. 3E is a depiction of another alternative operation encoding(opcode) format 370, having forty or more bits. Opcode format 370corresponds with opcode format 360 and comprises an optional prefix byte378. An instruction according to one embodiment may be encoded by one ormore of fields 378, 371, and 372. Up to two operand locations perinstruction may be identified by source operand identifiers 374 and 375and by prefix byte 378. For one embodiment, prefix byte 378 may be usedto identify 32-bit or 64-bit source and destination operands. For oneembodiment, destination operand identifier 376 is the same as sourceoperand identifier 374, whereas in other embodiments they are different.For an alternative embodiment, destination operand identifier 376 is thesame as source operand identifier 375, whereas in other embodiments theyare different. In one embodiment, an instruction operates on one or moreof the operands identified by operand identifiers 374 and 375 and one ormore operands identified by the operand identifiers 374 and 375 isoverwritten by the results of the instruction, whereas in otherembodiments, operands identified by identifiers 374 and 375 are writtento another data element in another register. Opcode formats 360 and 370allow register to register, memory to register, register by memory,register by register, register by immediate, register to memoryaddressing specified in part by MOD fields 363 and 373 and by optionalscale-index-base and displacement bytes.

Turning next to FIG. 3F, in some alternative embodiments, 64-bit (or128-bit, or 256-bit, or 512-bit or more) single instruction multipledata (SIMD) arithmetic operations may be performed through a coprocessordata processing (CDP) instruction. Operation encoding (opcode) format380 depicts one such CDP instruction having CDP opcode fields 382 and389. The type of CDP instruction, for alternative embodiments,operations may be encoded by one or more of fields 383, 384, 387, and388. Up to three operand locations per instruction may be identified,including up to two source operand identifiers 385 and 390 and onedestination operand identifier 386. One embodiment of the coprocessorcan operate on 8, 16, 32, and 64 bit values. For one embodiment, aninstruction is performed on integer data elements. In some embodiments,an instruction may be executed conditionally, using condition field 381.For some embodiments, source data sizes may be encoded by field 383. Insome embodiments, Zero (Z), negative (N), carry (C), and overflow (V)detection can be done on SIMD fields. For some instructions, the type ofsaturation may be encoded by field 384.

Turning next to FIG. 3G is a depiction of another alternative operationencoding (opcode) format 397, to provide SIMD permute controls withleading zero count functionality according to another embodiment,corresponding with a type of opcode format described in the “Intel®Advanced Vector Extensions Programming Reference,” which is availablefrom Intel Corp., Santa Clara, Calif. on the world-wide-web (www) atintel.com/products/processor/manuals/.

The original x86 instruction set provided for a 1-byte opcode withvarious formats of address syllable and immediate operand contained inadditional bytes whose presence was known from the first “opcode” byte.Additionally, there were certain byte values that were reserved asmodifiers to the opcode (called prefixes, as they had to be placedbefore the instruction). When the original palette of 256 opcode bytes(including these special prefix values) was exhausted, a single byte wasdedicated as an escape to a new set of 256 opcodes. As vectorinstructions (e.g., SIMD) were added, a need for more opcodes wasgenerated, and the “two byte” opcode map also was insufficient, evenwhen expanded through the use of prefixes. To this end, new instructionswere added in additional maps which use 2 bytes plus an optional prefixas an identifier.

Additionally, in order to facilitate additional registers in 64-bitmode, an additional prefix may be used (called “REX”) in between theprefixes and the opcode (and any escape bytes necessary to determine theopcode). In one embodiment, the REX may have 4 “payload” bits toindicate use of additional registers in 64-bit mode. In otherembodiments it may have fewer or more than 4 bits. The general format ofat least one instruction set (which corresponds generally with format360 and/or format 370) is illustrated generically by the following:

-   -   [prefixes] [rex] escape [escape2] opcode modrm (etc.)

Opcode format 397 corresponds with opcode format 370 and comprisesoptional VEX prefix bytes 391 (beginning with C4 hex in one embodiment)to replace most other commonly used legacy instruction prefix bytes andescape codes. For example, the following illustrates an embodiment usingtwo fields to encode an instruction, which may be used when a secondescape code is present in the original instruction, or when extra bits(e.g, the XB and W fields) in the REX field need to be used. In theembodiment illustrated below, legacy escape is represented by a newescape value, legacy prefixes are fully compressed as part of the“payload” bytes, legacy prefixes are reclaimed and available for futureexpansion, the second escape code is compressed in a “map” field, withfuture map or feature space available, and new features are added (e.g.,increased vector length and an additional source register specifier).

An instruction according to one embodiment may be encoded by one or moreof fields 391 and 392. Up to four operand locations per instruction maybe identified by field 391 in combination with source operandidentifiers 374 and 375 and in combination with an optionalscale-index-base (SIB) identifier 393, an optional displacementidentifier 394, and an optional immediate byte 395. For one embodiment,VEX prefix bytes 391 may be used to identify 32-bit or 64-bit source anddestination operands and/or 128-bit or 256-bit SIMD register or memoryoperands. For one embodiment, the functionality provided by opcodeformat 397 may be redundant with opcode format 370, whereas in otherembodiments they are different. Opcode formats 370 and 397 allowregister to register, memory to register, register by memory, registerby register, register by immediate, register to memory addressingspecified in part by MOD field 373 and by optional (SIB) identifier 393,an optional displacement identifier 394, and an optional immediate byte395.

Turning next to FIG. 3H is a depiction of another alternative operationencoding (opcode) format 398, to provide SIMD permute controls withleading zero count functionality according to another embodiment. Opcodeformat 398 corresponds with opcode formats 370 and 397 and comprisesoptional EVEX prefix bytes 396 (beginning with 62 hex in one embodiment)to replace most other commonly used legacy instruction prefix bytes andescape codes and provide additional functionality. An instructionaccording to one embodiment may be encoded by one or more of fields 396and 392. Up to four operand locations per instruction and a mask may beidentified by field 396 in combination with source operand identifiers374 and 375 and in combination with an optional scale-index-base (SIB)identifier 393, an optional displacement identifier 394, and an optionalimmediate byte 395. For one embodiment, EVEX prefix bytes 396 may beused to identify 32-bit or 64-bit source and destination operands and/or128-bit, 256-bit or 512-bit SIMD register or memory operands. For oneembodiment, the functionality provided by opcode format 398 may beredundant with opcode formats 370 or 397, whereas in other embodimentsthey are different. Opcode format 398 allows register to register,memory to register, register by memory, register by register, registerby immediate, register to memory addressing, with masks, specified inpart by MOD field 373 and by optional (SIB) identifier 393, an optionaldisplacement identifier 394, and an optional immediate byte 395. Thegeneral format of at least one instruction set (which correspondsgenerally with format 360 and/or format 370) is illustrated genericallyby the following:

-   -   evex1 RXBmmmmm WvvvLpp evex4 opcode modrm [sib] [disp] [imm]

For one embodiment an instruction encoded according to the EVEX format398 may have additional “payload” bits that may be used to provide SIMDpermute controls with leading zero count functionality with additionalnew features such as, for example, a user configurable mask register, oran additional operand, or selections from among 128-bit, 256-bit or512-bit vector registers, or more registers from which to select, etc.

For example, where VEX format 397 may be used to provide SIMD leadingzero count functionality without a mask, the EVEX format 398 may be usedto provide SIMD leading zero count functionality with an explicit userconfigurable mask. Additionally, where VEX format 397 may be used toprovide SIMD permute controls with leading zero count functionality on128-bit or 256-bit vector registers, EVEX format 398 may be used toprovide SIMD permute controls with leading zero count functionality on128-bit, 256-bit, 512-bit or larger (or smaller) vector registers.

Example instructions to provide SIMD vector leading zero countfunctionality, SIMD vector address conflict detection functionality, andSIMD vector population count functionality for efficient vector addressconflict resolution are illustrated by the following examples:

Instruction destination source1 source2 description VPLZCNTD Vmm1 Vmm2/Mask1 For each 32-bit element in the register Mem1 Vmm2 or in a vectorat memory location, Mem1, count the number of most significantcontiguous bits set to zero and store the counts as correspondingelements in the register Vmm1. VPLZCNTQ Vmm1 Vmm2/ Mask1 For each 64-bitelement in the register Mem1 Vmm2 or in a vector at memory location,Mem1, count the number of most significant contiguous bits set to zeroand store the counts as corresponding elements in the register Vmm1.VPCONFLICTD Vmm1 Vmm2/ Mask1 For each 32-bit element in the registerMem1 Vmm2 or in a vector at memory location, Mem1, compare it with everyless significant element to determine if they hold matching offsets, andin a corresponding element in the destination register, Vmm1, set anymask bits corresponding to a less significant data field holding amatching offset to one. Set all other bits in Vmm1 to zero. VPCONFLICTQVmm1 Vmm2/ Mask1 For each 64-bit element in the register Mem1 Vmm2 or ina vector at memory location, Mem1, compare it with every lesssignificant element to determine if they hold matching offsets, and in acorresponding element in the destination register, Vmm1, set any maskbits corresponding to a less significant data field holding a matchingoffset to one. Set all other bits in Vmm1 to zero. VPOPCNTD Vmm1 Vmm2/Mask1 For each 32-bit element in the register Mem1 Vmm2 or in a vectorat memory location, Mem1, count the number of bits set to one and storethe counts as corresponding elements in the register Vmm1. VPOPCNTQ Vmm1Vmm2/ Mask1 For each 64-bit element in the register Mem1 Vmm2 or in avector at memory location, Mem1, count the number of bits set to one andstore the counts as corresponding elements in the register Vmm1.

It will be appreciated that SIMD vector conflict instructions, as in theexamples above, may be used for variable sized elements and memoryoffsets to provide SIMD vector address conflict detection functionalityand to generate conflict masks for efficient SIMD address conflictresolution. It will also be appreciated that SIMD vector leading zerocount instructions, as in the examples above, may be used with variablesized elements and conflict masks to provide SIMD permute controls,which will be described in greater detail below, thereby permitting moreefficient SIMD address conflict resolution in registers withoutperforming dependent computations through memory. It will further beappreciated that SIMD vector population count instructions, as in theexamples above, may be used with variable sized elements and conflictmasks to efficiently compute iteration counts and to provide SIMDcompletion masks for each iteration of a SIMD address conflictresolution, which will be described in greater detail below. Thus theinstructions disclosed herein provide for more efficient SIMD addressconflict resolution especially in gather-modify-scatter applications.

FIG. 4A is a block diagram illustrating an in-order pipeline and aregister renaming stage, out-of-order issue/execution pipeline accordingto at least one embodiment of the invention. FIG. 4B is a block diagramillustrating an in-order architecture core and a register renaminglogic, out-of-order issue/execution logic to be included in a processoraccording to at least one embodiment of the invention. The solid linedboxes in FIG. 4A illustrate the in-order pipeline, while the dashedlined boxes illustrates the register renaming, out-of-orderissue/execution pipeline. Similarly, the solid lined boxes in FIG. 4Billustrate the in-order architecture logic, while the dashed lined boxesillustrates the register renaming logic and out-of-order issue/executionlogic.

In FIG. 4A, a processor pipeline 400 includes a fetch stage 402, alength decode stage 404, a decode stage 406, an allocation stage 408, arenaming stage 410, a scheduling (also known as a dispatch or issue)stage 412, a register read/memory read stage 414, an execute stage 416,a write back/memory write stage 418, an exception handling stage 422,and a commit stage 424.

In FIG. 4B, arrows denote a coupling between two or more units and thedirection of the arrow indicates a direction of data flow between thoseunits. FIG. 4B shows processor core 490 including a front end unit 430coupled to an execution engine unit 450, and both are coupled to amemory unit 470.

The core 490 may be a reduced instruction set computing (RISC) core, acomplex instruction set computing (CISC) core, a very long instructionword (VLIW) core, or a hybrid or alternative core type. As yet anotheroption, the core 490 may be a special-purpose core, such as, forexample, a network or communication core, compression engine, graphicscore, or the like.

The front end unit 430 includes a branch prediction unit 432 coupled toan instruction cache unit 434, which is coupled to an instructiontranslation lookaside buffer (TLB) 436, which is coupled to aninstruction fetch unit 438, which is coupled to a decode unit 440. Thedecode unit or decoder may decode instructions, and generate as anoutput one or more micro-operations, micro-code entry points,microinstructions, other instructions, or other control signals, whichare decoded from, or which otherwise reflect, or are derived from, theoriginal instructions. The decoder may be implemented using variousdifferent mechanisms. Examples of suitable mechanisms include, but arenot limited to, look-up tables, hardware implementations, programmablelogic arrays (PLAs), microcode read only memories (ROMs), etc. Theinstruction cache unit 434 is further coupled to a level 2 (L2) cacheunit 476 in the memory unit 470. The decode unit 440 is coupled to arename/allocator unit 452 in the execution engine unit 450.

The execution engine unit 450 includes the rename/allocator unit 452coupled to a retirement unit 454 and a set of one or more schedulerunit(s) 456. The scheduler unit(s) 456 represents any number ofdifferent schedulers, including reservations stations, centralinstruction window, etc. The scheduler unit(s) 456 is coupled to thephysical register file(s) unit(s) 458. Each of the physical registerfile(s) units 458 represents one or more physical register files,different ones of which store one or more different data types, such asscalar integer, scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point, etc., status (e.g., aninstruction pointer that is the address of the next instruction to beexecuted), etc. The physical register file(s) unit(s) 458 is overlappedby the retirement unit 454 to illustrate various ways in which registerrenaming and out-of-order execution may be implemented (e.g., using areorder buffer(s) and a retirement register file(s), using a futurefile(s), a history buffer(s), and a retirement register file(s); using aregister maps and a pool of registers; etc.). Generally, thearchitectural registers are visible from the outside of the processor orfrom a programmer's perspective. The registers are not limited to anyknown particular type of circuit. Various different types of registersare suitable as long as they are capable of storing and providing dataas described herein. Examples of suitable registers include, but are notlimited to, dedicated physical registers, dynamically allocated physicalregisters using register renaming, combinations of dedicated anddynamically allocated physical registers, etc. The retirement unit 454and the physical register file(s) unit(s) 458 are coupled to theexecution cluster(s) 460. The execution cluster(s) 460 includes a set ofone or more execution units 462 and a set of one or more memory accessunits 464. The execution units 462 may perform various operations (e.g.,shifts, addition, subtraction, multiplication) and on various types ofdata (e.g., scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point). While some embodimentsmay include a number of execution units dedicated to specific functionsor sets of functions, other embodiments may include only one executionunit or multiple execution units that all perform all functions. Thescheduler unit(s) 456, physical register file(s) unit(s) 458, andexecution cluster(s) 460 are shown as being possibly plural becausecertain embodiments create separate pipelines for certain types ofdata/operations (e.g., a scalar integer pipeline, a scalar floatingpoint/packed integer/packed floating point/vector integer/vectorfloating point pipeline, and/or a memory access pipeline that each havetheir own scheduler unit, physical register file(s) unit, and/orexecution cluster, and in the case of a separate memory access pipeline,certain embodiments are implemented in which only the execution clusterof this pipeline has the memory access unit(s) 464). It should also beunderstood that where separate pipelines are used, one or more of thesepipelines may be out-of-order issue/execution and the rest in-order.

The set of memory access units 464 is coupled to the memory unit 470,which includes a data TLB unit 472 coupled to a data cache unit 474coupled to a level 2 (L2) cache unit 476. In one exemplary embodiment,the memory access units 464 may include a load unit, a store addressunit, and a store data unit, each of which is coupled to the data TLBunit 472 in the memory unit 470. The L2 cache unit 476 is coupled to oneor more other levels of cache and eventually to a main memory.

By way of example, the exemplary register renaming, out-of-orderissue/execution core architecture may implement the pipeline 400 asfollows: 1) the instruction fetch 438 performs the fetch and lengthdecoding stages 402 and 404; 2) the decode unit 440 performs the decodestage 406; 3) the rename/allocator unit 452 performs the allocationstage 408 and renaming stage 410; 4) the scheduler unit(s) 456 performsthe schedule stage 412; 5) the physical register file(s) unit(s) 458 andthe memory unit 470 perform the register read/memory read stage 414; theexecution cluster 460 perform the execute stage 416; 6) the memory unit470 and the physical register file(s) unit(s) 458 perform the writeback/memory write stage 418; 7) various units may be involved in theexception handling stage 422; and 8) the retirement unit 454 and thephysical register file(s) unit(s) 458 perform the commit stage 424.

The core 490 may support one or more instructions sets (e.g., the x86instruction set (with some extensions that have been added with newerversions); the MIPS instruction set of MIPS Technologies of Sunnyvale,Calif.; the ARM instruction set (with optional additional extensionssuch as NEON) of ARM Holdings of Sunnyvale, Calif.).

It should be understood that the core may support multithreading(executing two or more parallel sets of operations or threads), and maydo so in a variety of ways including time sliced multithreading,simultaneous multithreading (where a single physical core provides alogical core for each of the threads that physical core issimultaneously multithreading), or a combination thereof (e.g., timesliced fetching and decoding and simultaneous multithreading thereaftersuch as in the Intel® Hyperthreading technology).

While register renaming is described in the context of out-of-orderexecution, it should be understood that register renaming may be used inan in-order architecture. While the illustrated embodiment of theprocessor also includes a separate instruction and data cache units434/474 and a shared L2 cache unit 476, alternative embodiments may havea single internal cache for both instructions and data, such as, forexample, a Level 1 (L1) internal cache, or multiple levels of internalcache. In some embodiments, the system may include a combination of aninternal cache and an external cache that is external to the core and/orthe processor. Alternatively, all of the cache may be external to thecore and/or the processor.

FIG. 5 is a block diagram of a single core processor and a multicoreprocessor 500 with integrated memory controller and graphics accordingto embodiments of the invention. The solid lined boxes in FIG. 5illustrate a processor 500 with a single core 502A, a system agent 510,a set of one or more bus controller units 516, while the optionaladdition of the dashed lined boxes illustrates an alternative processor500 with multiple cores 502A-N, a set of one or more integrated memorycontroller unit(s) 514 in the system agent unit 510, and an integratedgraphics logic 508.

The memory hierarchy includes one or more levels of cache within thecores, a set or one or more shared cache units 506, and external memory(not shown) coupled to the set of integrated memory controller units514. The set of shared cache units 506 may include one or more mid-levelcaches, such as level 2 (L2), level 3 (L3), level 4 (L4), or otherlevels of cache, a last level cache (LLC), and/or combinations thereof.While in one embodiment a ring based interconnect unit 512 interconnectsthe integrated graphics logic 508, the set of shared cache units 506,and the system agent unit 510, alternative embodiments may use anynumber of well-known techniques for interconnecting such units.

In some embodiments, one or more of the cores 502A-N are capable ofmulti-threading. The system agent 510 includes those componentscoordinating and operating cores 502A-N. The system agent unit 510 mayinclude for example a power control unit (PCU) and a display unit. ThePCU may be or include logic and components needed for regulating thepower state of the cores 502A-N and the integrated graphics logic 508.The display unit is for driving one or more externally connecteddisplays.

The cores 502A-N may be homogenous or heterogeneous in terms ofarchitecture and/or instruction set. For example, some of the cores502A-N may be in order while others are out-of-order. As anotherexample, two or more of the cores 502A-N may be capable of execution thesame instruction set, while others may be capable of executing only asubset of that instruction set or a different instruction set.

The processor may be a general-purpose processor, such as a Core™ i3,i5, i7, 2 Duo and Quad, Xeon™, Itanium™, XScale™ or StrongARM™processor, which are available from Intel Corporation, of Santa Clara,Calif. Alternatively, the processor may be from another company, such asARM Holdings, Ltd, MIPS, etc. The processor may be a special-purposeprocessor, such as, for example, a network or communication processor,compression engine, graphics processor, co-processor, embeddedprocessor, or the like. The processor may be implemented on one or morechips. The processor 500 may be a part of and/or may be implemented onone or more substrates using any of a number of process technologies,such as, for example, BiCMOS, CMOS, or NMOS.

FIGS. 6-8 are exemplary systems suitable for including the processor500, while FIG. 9 is an exemplary system on a chip (SoC) that mayinclude one or more of the cores 502. Other system designs andconfigurations known in the arts for laptops, desktops, handheld PCs,personal digital assistants, engineering workstations, servers, networkdevices, network hubs, switches, embedded processors, digital signalprocessors (DSPs), graphics devices, video game devices, set-top boxes,micro controllers, cell phones, portable media players, hand helddevices, and various other electronic devices, are also suitable. Ingeneral, a huge variety of systems or electronic devices capable ofincorporating a processor and/or other execution logic as disclosedherein are generally suitable.

Referring now to FIG. 6, shown is a block diagram of a system 600 inaccordance with one embodiment of the present invention. The system 600may include one or more processors 610, 615, which are coupled tographics memory controller hub (GMCH) 620. The optional nature ofadditional processors 615 is denoted in FIG. 6 with broken lines.

Each processor 610,615 may be some version of the processor 500.However, it should be noted that it is unlikely that integrated graphicslogic and integrated memory control units would exist in the processors610,615. FIG. 6 illustrates that the GMCH 620 may be coupled to a memory640 that may be, for example, a dynamic random access memory (DRAM). TheDRAM may, for at least one embodiment, be associated with a non-volatilecache.

The GMCH 620 may be a chipset, or a portion of a chipset. The GMCH 620may communicate with the processor(s) 610, 615 and control interactionbetween the processor(s) 610, 615 and memory 640. The GMCH 620 may alsoact as an accelerated bus interface between the processor(s) 610, 615and other elements of the system 600. For at least one embodiment, theGMCH 620 communicates with the processor(s) 610, 615 via a multi-dropbus, such as a frontside bus (FSB) 695.

Furthermore, GMCH 620 is coupled to a display 645 (such as a flat paneldisplay). GMCH 620 may include an integrated graphics accelerator. GMCH620 is further coupled to an input/output (I/O) controller hub (ICH)650, which may be used to couple various peripheral devices to system600. Shown for example in the embodiment of FIG. 6 is an externalgraphics device 660, which may be a discrete graphics device coupled toICH 650, along with another peripheral device 670.

Alternatively, additional or different processors may also be present inthe system 600. For example, additional processor(s) 615 may includeadditional processors(s) that are the same as processor 610, additionalprocessor(s) that are heterogeneous or asymmetric to processor 610,accelerators (such as, e.g., graphics accelerators or digital signalprocessing (DSP) units), field programmable gate arrays, or any otherprocessor. There can be a variety of differences between the physicalresources 610, 615 in terms of a spectrum of metrics of merit includingarchitectural, micro-architectural, thermal, power consumptioncharacteristics, and the like. These differences may effectivelymanifest themselves as asymmetry and heterogeneity amongst theprocessors 610, 615. For at least one embodiment, the various processors610, 615 may reside in the same die package.

Referring now to FIG. 7, shown is a block diagram of a second system 700in accordance with an embodiment of the present invention. As shown inFIG. 7, multiprocessor system 700 is a point-to-point interconnectsystem, and includes a first processor 770 and a second processor 780coupled via a point-to-point interconnect 750. Each of processors 770and 780 may be some version of the processor 500 as one or more of theprocessors 610,615.

While shown with only two processors 770, 780, it is to be understoodthat the scope of the present invention is not so limited. In otherembodiments, one or more additional processors may be present in a givenprocessor.

Processors 770 and 780 are shown including integrated memory controllerunits 772 and 782, respectively. Processor 770 also includes as part ofits bus controller units point-to-point (P-P) interfaces 776 and 778;similarly, second processor 780 includes P-P interfaces 786 and 788.Processors 770, 780 may exchange information via a point-to-point (P-P)interface 750 using P-P interface circuits 778, 788. As shown in FIG. 7,IMCs 772 and 782 couple the processors to respective memories, namely amemory 732 and a memory 734, which may be portions of main memorylocally attached to the respective processors.

Processors 770, 780 may each exchange information with a chipset 790 viaindividual P-P interfaces 752, 754 using point to point interfacecircuits 776, 794, 786, 798. Chipset 790 may also exchange informationwith a high-performance graphics circuit 738 via a high-performancegraphics interface 739.

A shared cache (not shown) may be included in either processor oroutside of both processors, yet connected with the processors via P-Pinterconnect, such that either or both processors' local cacheinformation may be stored in the shared cache if a processor is placedinto a low power mode.

Chipset 790 may be coupled to a first bus 716 via an interface 796. Inone embodiment, first bus 716 may be a Peripheral Component Interconnect(PCI) bus, or a bus such as a PCI Express bus or another thirdgeneration I/O interconnect bus, although the scope of the presentinvention is not so limited.

As shown in FIG. 7, various I/O devices 714 may be coupled to first bus716, along with a bus bridge 718 which couples first bus 716 to a secondbus 720. In one embodiment, second bus 720 may be a low pin count (LPC)bus. Various devices may be coupled to second bus 720 including, forexample, a keyboard and/or mouse 722, communication devices 727 and astorage unit 728 such as a disk drive or other mass storage device whichmay include instructions/code and data 730, in one embodiment. Further,an audio I/O 724 may be coupled to second bus 720. Note that otherarchitectures are possible. For example, instead of the point-to-pointarchitecture of FIG. 7, a system may implement a multi-drop bus or othersuch architecture.

Referring now to FIG. 8, shown is a block diagram of a third system 800in accordance with an embodiment of the present invention Like elementsin FIG. 7 and FIG. 8 bear like reference numerals, and certain aspectsof FIG. 7 have been omitted from FIG. 8 in order to avoid obscuringother aspects of FIG. 8.

FIG. 8 illustrates that the processors 870, 880 may include integratedmemory and I/O control logic (“CL”) 872 and 882, respectively. For atleast one embodiment, the CL 872, 882 may include integrated memorycontroller units such as that described above in connection with FIGS. 5and 7. In addition. CL 872, 882 may also include I/O control logic. FIG.8 illustrates that not only are the memories 832, 834 coupled to the CL872, 882, but also that I/O devices 814 are also coupled to the controllogic 872, 882. Legacy I/O devices 815 are coupled to the chipset 890.

Referring now to FIG. 9, shown is a block diagram of a SoC 900 inaccordance with an embodiment of the present invention. Similar elementsin FIG. 5 bear like reference numerals. Also, dashed lined boxes areoptional features on more advanced SoCs. In FIG. 9, an interconnectunit(s) 902 is coupled to: an application processor 910 which includes aset of one or more cores 502A-N and shared cache unit(s) 506; a systemagent unit 510; a bus controller unit(s) 516; an integrated memorycontroller unit(s) 514; a set of one or more media processors 920 whichmay include integrated graphics logic 508, an image processor 924 forproviding still and/or video camera functionality, an audio processor926 for providing hardware audio acceleration, and a video processor 928for providing video encode/decode acceleration; an static random accessmemory (SRAM) unit 930; a direct memory access (DMA) unit 932; and adisplay unit 940 for coupling to one or more external displays.

FIG. 10 illustrates a processor containing a central processing unit(CPU) and a graphics processing unit (GPU), which may perform at leastone instruction according to one embodiment. In one embodiment, aninstruction to perform operations according to at least one embodimentcould be performed by the CPU. In another embodiment, the instructioncould be performed by the GPU. In still another embodiment, theinstruction may be performed through a combination of operationsperformed by the GPU and the CPU. For example, in one embodiment, aninstruction in accordance with one embodiment may be received anddecoded for execution on the GPU. However, one or more operations withinthe decoded instruction may be performed by a CPU and the resultreturned to the GPU for final retirement of the instruction. Conversely,in some embodiments, the CPU may act as the primary processor and theGPU as the co-processor.

In some embodiments, instructions that benefit from highly parallel,throughput processors may be performed by the GPU, while instructionsthat benefit from the performance of processors that benefit from deeplypipelined architectures may be performed by the CPU. For example,graphics, scientific applications, financial applications and otherparallel workloads may benefit from the performance of the GPU and beexecuted accordingly, whereas more sequential applications, such asoperating system kernel or application code may be better suited for theCPU.

In FIG. 10, processor 1000 includes a CPU 1005, GPU 1010, imageprocessor 1015, video processor 1020, USB controller 1025, UARTcontroller 1030, SPI/SDIO controller 1035, display device 1040,High-Definition Multimedia Interface (HDMI) controller 1045, MIPIcontroller 1050, flash memory controller 1055, dual data rate (DDR)controller 1060, security engine 1065, and I²S/I²C (Integrated InterchipSound/Inter-Integrated Circuit) interface 1070. Other logic and circuitsmay be included in the processor of FIG. 10, including more CPUs or GPUsand other peripheral interface controllers.

One or more aspects of at least one embodiment may be implemented byrepresentative data stored on a machine-readable medium which representsvarious logic within the processor, which when read by a machine causesthe machine to fabricate logic to perform the techniques describedherein. Such representations, known as “IP cores” may be stored on atangible, machine readable medium (“tape”) and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor. For example, IPcores, such as the Cortex™ family of processors developed by ARMHoldings, Ltd. and Loongson IP cores developed the Institute ofComputing Technology (ICT) of the Chinese Academy of Sciences may belicensed or sold to various customers or licensees, such as TexasInstruments, Qualcomm, Apple, or Samsung and implemented in processorsproduced by these customers or licensees.

FIG. 11 shows a block diagram illustrating the development of IP coresaccording to one embodiment. Storage 1130 includes simulation software1120 and/or hardware or software model 1110. In one embodiment, the datarepresenting the IP core design can be provided to the storage 1130 viamemory 1140 (e.g., hard disk), wired connection (e.g., internet) 1150 orwireless connection 1160. The IP core information generated by thesimulation tool and model can then be transmitted to a fabricationfacility where it can be fabricated by a third party to perform at leastone instruction in accordance with at least one embodiment.

In some embodiments, one or more instructions may correspond to a firsttype or architecture (e.g., x86) and be translated or emulated on aprocessor of a different type or architecture (e.g., ARM). Aninstruction, according to one embodiment, may therefore be performed onany processor or processor type, including ARM, x86, MIPS, a GPU, orother processor type or architecture.

FIG. 12 illustrates how an instruction of a first type is emulated by aprocessor of a different type, according to one embodiment. In FIG. 12,program 1205 contains some instructions that may perform the same orsubstantially the same function as an instruction according to oneembodiment. However the instructions of program 1205 may be of a typeand/or format that is different or incompatible with processor 1215,meaning the instructions of the type in program 1205 may not be able tobe executed natively by the processor 1215. However, with the help ofemulation logic, 1210, the instructions of program 1205 are translatedinto instructions that are natively capable of being executed by theprocessor 1215. In one embodiment, the emulation logic is embodied inhardware. In another embodiment, the emulation logic is embodied in atangible, machine-readable medium containing software to translateinstructions of the type in the program 1205 into the type nativelyexecutable by the processor 1215. In other embodiments, emulation logicis a combination of fixed-function or programmable hardware and aprogram stored on a tangible, machine-readable medium. In oneembodiment, the processor contains the emulation logic, whereas in otherembodiments, the emulation logic exists outside of the processor and isprovided by a third party. In one embodiment, the processor is capableof loading the emulation logic embodied in a tangible, machine-readablemedium containing software by executing microcode or firmware containedin or associated with the processor.

FIG. 13 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to embodimentsof the invention. In the illustrated embodiment, the instructionconverter is a software instruction converter, although alternativelythe instruction converter may be implemented in software, firmware,hardware, or various combinations thereof. FIG. 13 shows a program in ahigh level language 1302 may be compiled using an x86 compiler 1304 togenerate x86 binary code 1306 that may be natively executed by aprocessor with at least one x86 instruction set core 1316. The processorwith at least one x86 instruction set core 1316 represents any processorthat can perform substantially the same functions as a Intel processorwith at least one x86 instruction set core by compatibly executing orotherwise processing (1) a substantial portion of the instruction set ofthe Intel x86 instruction set core or (2) object code versions ofapplications or other software targeted to run on an Intel processorwith at least one x86 instruction set core, in order to achievesubstantially the same result as an Intel processor with at least onex86 instruction set core. The x86 compiler 1304 represents a compilerthat is operable to generate x86 binary code 1306 (e.g., object code)that can, with or without additional linkage processing, be executed onthe processor with at least one x86 instruction set core 1316.Similarly, FIG. 13 shows the program in the high level language 1302 maybe compiled using an alternative instruction set compiler 1308 togenerate alternative instruction set binary code 1310 that may benatively executed by a processor without at least one x86 instructionset core 1314 (e.g., a processor with cores that execute the MIPSinstruction set of MIPS Technologies of Sunnyvale, Calif. and/or thatexecute the ARM instruction set of ARM Holdings of Sunnyvale, Calif.).The instruction converter 1312 is used to convert the x86 binary code1306 into code that may be natively executed by the processor without anx86 instruction set core 1314. This converted code is not likely to bethe same as the alternative instruction set binary code 1310 because aninstruction converter capable of this is difficult to make; however, theconverted code will accomplish the general operation and be made up ofinstructions from the alternative instruction set. Thus, the instructionconverter 1312 represents software, firmware, hardware, or a combinationthereof that, through emulation, simulation or any other process, allowsa processor or other electronic device that does not have an x86instruction set processor or core to execute the x86 binary code 1306.

FIG. 14A illustrates a flow diagram for one embodiment of an exampleprocess for using an instruction to provide SIMD permute controls withleading zero count functionality for efficient vector address conflictresolution. Process 1401 and other processes herein disclosed areperformed by processing blocks that may comprise dedicated hardware orsoftware or firmware operation codes executable by general purposemachines or by special purpose machines or by a combination of both.

In processing block 1410 of process 1401 the set of indices isinitialized, e.g. to the values 7, 2, 7, 1 and 7. It will be appreciatedthat the number of offset indices and the values of the offset indicesis intended to be illustrative and not restrictive of embodiments of theinvention. In particular, the number of offset indices in a register maybe determined by the particular application and/or the size of dataelements corresponding to the indices. The example values of offsetindices are simply intended to illustrate resolution of dependencyconflicts. In processing block 1415 the elements left mask is set to all(e.g. five) ones. In processing block 1420 the dependencies masks areset according to a prior techniques of process 1405 to reflect allmatching offset indices. Then in processing block 1425 a set of ordermasks is initialized. In processing block 1430 the conflict masks arecomputed by performing a bitwise AND between the dependencies masks andthe order masks. While the prior technique of process 1405 isillustrated, in contrast, it will be appreciated that an improvement onprocess 1405 for generating the conflict masks in processing block 1430,but directly as the result of one SIMD vector conflict detectioninstruction, will be described in more detail below starting with FIG.14B.

Proceeding next to processing block 1439, the leading zero counts arecomputed using a vector packed leading zero count instruction, VPLZCNT,on the conflict masks by counting the number of most significantcontiguous bits that are set to zero for each data field of the conflictmasks and storing each count as a value in a corresponding data field ofthe leading zero counts. In processing block 1440 the maximum counts areinitialized to all fours, which is a value one less than the number ofbits used to represent a conflict mask in the example illustrated. Inprocessing block 1445 a set of permute indices is computed by performinga SIMD packed subtraction, PSUB, subtracting the value of each leadingzero count from a corresponding maximum count value, one less than thenumber of bits used to represent a conflict mask, to generate acorresponding difference of the maximum counts minus the leading zerocounts. It will be appreciated that those locations corresponding tooffset indices that are not dependent on a prior computation havepermute indices of negative one, which may also be used advantageously.

In processing block 1450 data is gathered from memory and modifiedvalues are computed according to the offset indices and an elements leftmask which is (optionally) all ones. Next in processing block 1455 theelements left mask is recomputed using a packed compare not equalinstruction, PCMPNEQ, comparing the permute indices advantageously withall negative ones. In processing block 1460 a determination is madewhether the elements left mask is zero (0). If so in processing block1465 the data is scattered to memory using the offset indices, and theprocessing of this set of SIMD data ends in processing block 1499.

Otherwise in processing block 1470 the data is permuted by performing aSIMD vector packed permutation, VPERM, employing the permute indices andthe elements left mask as a completion mask to advantageously updateonly the elements left to process. In processing block 1475 the requiredcomputations are performed on the data elements left to process usingthe elements left mask as a completion mask. Then in a prior techniqueprocess 1406 a set of conflicted out elements is initialized bybroadcasting the elements left mask to all elements in processing block1480. Then the set of conflict masks is recomputed using a vector packedAND instruction on the previous conflict masks and the new conflictedout elements. The new elements left mask is then computed using a packedcompare not equal instruction, PCMPNEQ, comparing each conflict maskwith all zeroes. Processing then reiterates beginning in processingblock 1460 with the testing of a new elements left mask. While the priortechnique of process 1406 is illustrated, in contrast, it will beappreciated that an improvement on process 1406 for generating theelements left mask of processing block 1490 by using instead, aniteration count, the result of a SIMD vector population countinstruction, will also be described below starting with FIG. 14C.

It will be appreciated that SIMD vector leading zero count instructions,as in the embodiments described herein, may be used advantageously withvariable sized elements and conflict masks to provide SIMD permutecontrols, thereby permitting more efficient SIMD address conflictresolution in registers without performing dependent computationsthrough memory.

FIG. 14B illustrates a flow diagram for one embodiment of an example ofusing an instruction to provide SIMD vector address conflict detectionfunctionality. In processing block 1410 of process 1402 the set ofoffset indices is initialized, e.g. to the values 7, 2, 7, 1 and 7. Itwill again be appreciated that the number of offset indices and thevalues of the offset indices is intended to be illustrative and notrestrictive of embodiments of the invention. In particular, the numberof offset indices in a register may be determined by the particularapplication and/or the size of data elements corresponding to theindices. The example values of offset indices are simply intended toillustrate resolution of dependency conflicts. In processing block 1415the elements left mask is set to all (e.g. five) ones.

In processing block 1431 the conflict masks are computed using a SIMDvector packed conflict instruction, VPCONFLICT, comparing an offset ineach element of the set of offset indices with an offset in every lesssignificant element to determine if they hold matching offset. It willbe appreciated that processing block 1431 represents a notableimprovement on the prior technique of process 1405.

In processing block 1450 data is gathered from memory and modifiedvalues are computed according to the offset indices and an elements leftmask which is (optionally) all ones. Next in the prior technique process1406 a set of conflicted out elements is initialized by broadcasting theelements left mask to all elements in processing block 1480. Then inprocessing block 1485 the set of conflict masks is recomputed using avector packed AND instruction on the previous conflict masks and the newconflicted out elements. Then the new elements left mask is computed inprocessing block 1490 using a packed compare not equal instruction,PCMPNEQ, comparing each conflict mask with all zeroes. In processingblock 1462 the elements left mask are negated to form a did these mask,and the data elements are scattered in processing block 1466 to memoryaccording to the offset indices. In processing block 1460 adetermination is made whether the elements left mask is zero (0). If soin processing of this set of SIMD data ends in processing block 1499.Otherwise processing reiterates beginning in processing block 1450 ofprocess 1402.

It will be appreciated that SIMD vector address conflict detectioninstructions, as in the embodiments described herein, may be used forvariable sized elements and memory offsets to provide SIMD vectoraddress conflict detection functionality and to generate conflict masksfor efficient SIMD address conflict resolution. It will also beappreciated that SIMD vector address conflict detection instructions maybe used in combination with SIMD vector leading zero count instructions,as in the embodiments described herein, to provide SIMD permutecontrols, for more efficient SIMD address conflict resolution especiallyin certain gather-modify-scatter applications permitting addressconflict resolution in registers without performing dependentcomputations through memory.

FIG. 14C illustrates a flow diagram for one embodiment of an example ofusing an instruction to provide SIMD vector address conflict resolutionwith vector population count functionality. In processing block 1410 ofprocess 1403 the set of offset indices is once again initialized, e.g.to the values 7, 2, 7, 1 and 7. In processing block 1431 the conflictmasks are computed using a SIMD vector packed conflict instruction,VPCONFLICT, comparing an offset in each element of the set of offsetindices with an offset in every less significant element to determine ifthey hold matching offset.

In processing block 1432, the iteration counts are computed using a SIMDvector population count instruction, VPOPCNT, counting a number of bitsset to one for each data field of the conflict masks and storing eachcount as a value in a corresponding data field of the iteration counts.Then a mask is computed in processing block 1433 using a vector packedcompare greater than instruction, VPCMPGT, comparing each iterationcount with a corresponding threshold value to test if any of thedependencies would require too many iterations. In processing block1434, it is determined if all of the tests comparing iteration counts tothe thresholds were negative, resulting in zeroes. If not then inprocessing block 1436 a scalar processing version of the computations isperformed for these elements because there are too many serialdependencies.

Otherwise, a zero test result indicates that the dependencies may beresolve in a SIMD fashion without too many iterations, and so processingproceeds to processing block 1446 where the elements left mask isinitialized to all ones. The elements of an increment vector areinitialized, all to values of one in processing block 1447, and aniteration vector is initialized to zeroes in processing block 1448.

In processing block 1449 a mask, do_these, of which elements are readyto process is computed using a packed compare for equality instruction,PCMPEQ, comparing each iteration count with the current iterationvector. In processing block 1450 data is gathered from memory andmodified values are computed according to the offset indices and thecompletion mask, do_these, of which elements to process. Then anelements left mask is computed in processing block 1451 using a vectorpacked compare greater than instruction, VPCMPGT, comparing eachiteration count with the current iteration vector. It will beappreciated that processing block 1451 represents an improvement on theprior technique of process 1406. In processing block 1458 the processeddata elements are scattered back to memory according to the offsetindices and the completion mask, do_these, and the processing proceedsto processing block 1460 where a determination is made if the elementsleft mask is zero, indicating that no elements are left to process. Ifso processing of this set of SIMD data ends in processing block 1499.Otherwise processing proceeds to processing block 1463 where theiteration vector is incremented by a packed addition, PADD, of theincrement vector to the current iteration vector. Then processingreiterates beginning in processing block 1449 of process 1403. It willbe appreciated that SIMD vector population count instructions, as in theembodiments described herein, may be used with variable sized elementsand conflict masks to efficiently compute iteration counts and toprovide SIMD completion masks for iterations of a SIMD address conflictresolution.

FIG. 14D illustrates a flow diagram for an alternative embodiment of anexample of using the combined instructions, for SIMD vector packedconflict detection, SIMD vector packed population counts, and SIMDvector packed leading zero counts to provide efficient SIMD vectoraddress conflict resolution. In processing block 1410 of process 1404the set of offset indices is once again initialized, e.g. to the values7, 2, 7, 1 and 7. In processing block 1431 the conflict masks arecomputed using the SIMD vector packed conflict instruction, VPCONFLICT,comparing an offset in each element of the set of offset indices with anoffset in every less significant element to determine if they holdmatching offset. In processing block 1432, the iteration counts arecomputed using the SIMD vector population count instruction, VPOPCNT,counting a number of bits set to one for each data field of the conflictmasks and storing each count as a value in a corresponding data field ofthe iteration counts. Then an elements left mask is computed inprocessing block 1437 using a vector packed compare greater thaninstruction, VPCMPGT, comparing each iteration count with a vector ofall zeroes. In processing block 1438 a determination is made whether ornot the elements left mask is zero, indicating that there are nodependencies to resolve, in which case processing proceeds directly toprocessing blocks 1452, 1460, 1465 and 1499, where the data elements maybe processed without any dependency resolution.

Otherwise, if the elements left mask is not zero in processing block1438, then processing proceeds to processing block 1439 where theleading zero counts are computed using a vector packed leading zerocount instruction, VPLZCNT, on the conflict masks by counting the numberof most significant contiguous bits that are set to zero for each datafield of the conflict masks and storing each count as a value in acorresponding data field of the leading zero counts. In processing block1440 the maximum counts are initialized to all fours, which in thisexample, is a value of one less than the number of bits used torepresent a conflict mask. In processing block 1445 a set of permuteindices is computed by performing a SIMD packed subtraction, PSUB,subtracting the value of each leading zero count from a correspondingmaximum count value, one less than the number of bits used to representa conflict mask, to generate a corresponding difference of the maximumcounts minus the leading zero counts. One will be reminded that thoselocations corresponding to offset indices that are not dependent on aprior computation have permute indices of negative one, which may beused advantageously.

The elements of an increment vector are initialized, all to values ofone in processing block 1447, and an iteration vector is initialized tozeroes in processing block 1448. In processing block 1452 data isgathered from memory and modified values are computed according to theoffset indices and the optional completion mask of all ones. It will beappreciated that any incorrectly modified data values will besubsequently resolved

In processing block 1460 a determination is made if the elements leftmask is zero, indicating that no elements are left to process. If so inprocessing block 1465 the processed data elements are scattered back tomemory according to the offset indices and the processing proceeds toprocessing block 1499 where processing of this set of SIMD data ends. Itwill be appreciated that the scatter operation will store the latestupdated value to any one memory location thereby correctly resolving anyconflict dependencies.

Otherwise if the elements left mask is not zero in processing block1460, then processing proceeds to processing block 1463 where theiteration vector is incremented by a packed addition, PADD, of theincrement vector to the current iteration vector. In processing block1464 a mask, do_these, of which elements are ready to process iscomputed using a packed compare for equality instruction, PCMPEQ,comparing each iteration count with the newly computed iteration vector.In processing block 1470 the data is permuted by performing a SIMDvector packed permutation, VPERM, employing the permute indices and thedo_these mask as a completion mask to advantageously update only theelements to process in this iteration. In processing block 1475 therequired computations are performed on the data elements to process inthis iteration using the do_these mask as a completion mask. An elementsleft mask is computed in processing block 1476 using a vector packedcompare greater than instruction, VPCMPGT, comparing each iterationcount with the current iteration vector. Then processing reiteratesbeginning in processing block 1460 of process 1404. It will beappreciated that the combination of instructions and logic disclosedherein, for SIMD vector packed conflict detection, SIMD vector packedpopulation counts, and SIMD vector packed leading zero counts, providefor more efficient SIMD address conflict resolution especially incertain gather-modify-scatter applications.

FIG. 15A illustrates a flow diagram for one embodiment of a process toprovide SIMD permute controls for efficient vector address conflictresolution with leading zero count functionality. Process 1501 and otherprocesses herein disclosed are performed by processing blocks that maycomprise dedicated hardware or software or firmware operation codesexecutable by general purpose machines or by special purpose machines orby a combination of both.

In processing block 1535 of process 1501 the number of most significantcontiguous bits that are set to zero are counted for each element of afirst vector register. In processing block 1540 each count is stored asa value in a corresponding data field of a first vector destinationregister. In processing block 1545 the value of each of the data fieldsin the first vector destination register are subtracted from acorresponding value, one less than the number of bits used to store theelements in the first vector register to generate a correspondingdifference. In processing block 1550 each of the correspondingdifferences is stored as a permute control value in a corresponding datafield of a second vector destination register. In processing block 1555the values of each of the data fields in the second vector destinationregister are compared with a corresponding copy of a specific value(e.g. such as negative one, or some other value) in each of the datafields in a vector register to detect elements ready to process, and inprocessing block 1560 the comparison results are stored as acorresponding mask value in a vector completion mask indicating nextelements ready to process, the vector mask to be used along with the setof permute control values. In processing block 1565, the SIMDcomputation is performed and in processing block 1580 the SIMD data ispermuted using the permute control values and the completion mask toprepare the input data for the next elements to process. In processingblock 1595 a determination is made whether or not processing of all theelements is finished, and if so processing of these elements ends inprocessing block 1599. Otherwise, in processing block 1586 a logical ANDof each element of the first vector source is performed with a copy ofthe completion mask and processing reiterates beginning in processingblock 1535. It will be appreciated that while process 1501, asillustrated, does not presume that the processed elements need to bestored to memory, any such storing, or scattering to memory, togetherwith additional subsequent iterations of process 1501 may be performedin accordance with alternative embodiments of the invention.

FIG. 15B illustrates a flow diagram for one embodiment of a process 1502to provide SIMD vector address conflict detection functionality.

In processing block 1505 an offset in each element of a first registeror memory vector source is compared with an offset in every lesssignificant element of the vector source to determine if they holdmatching offsets. In processing block 1510 any mask bits correspondingto less significant elements in the first vector source holding offsetsmatching the offset in the element corresponding to a mask in a firstvector destination are set to one. Any other bits in the destinationregister are set to a second value (e.g. zero) in processing block 1511.

In processing block 1516 the values of each of the masks stored in thefirst destination register are compared with a corresponding copy of aspecific value (e.g. of zero) in another vector, in order to generate amask of the elements that depend upon computations of less significantelements. In processing block 1572 the mask of elements that depend uponincomplete computations on less significant elements is used to detectelements ready to process and generate a completion mask. In processingblock 1564 the SIMD computation is performed on the data using thecompletion mask. Then in processing block 1569 the mask of elements thatdepend upon incomplete computations on less significant elements isupdated. A determination is made in processing block 1595 whether or notprocessing of all the elements is finished, and if so processing ofthese elements ends in processing block 1599. Otherwise, processingreiterates beginning in processing block 1572. It will also beappreciated that while process 1502, as illustrated, does not presumethat the processed elements need to be stored to memory, any suchstoring, or scattering to memory, together with additional subsequentiterations of process 1502 may be performed in accordance withalternative embodiments of the invention.

FIG. 15C illustrates a flow diagram for one embodiment of a process 1503to provide SIMD vector address conflict resolution with vectorpopulation count functionality. In processing block 1515 the number ofbits set to one is counted for each element in a first vector source,each element storing the same variable number of bits according toparticular population count instruction. In processing block 1520 thecounts are stored as a value in a corresponding element in a firstvector destination. In processing block 1525 the counts in the firstdestination register are compared, each with a corresponding value in asecond vector source, in order to determine if they exceed a thresholdvalue and to generate corresponding mask values that, in processingblock 1530, are stored according to the comparison results in a firstvector mask destination. In processing block 1570 the counts in thefirst destination register are compared, each with a corresponding valuein a third vector source, in order to determine the correspondingelements in a fourth vector source on which to operate in a currentiteration. The comparison results are stored in processing block 1575 asmask values in a completion mask to be used to perform a SIMD operation.A determination is made in processing block 1577 whether or notprocessing of all the elements is finished, and if so processing ofthese elements ends in processing block 1599. Otherwise processingproceeds to processing block 1563 where one or more SIMD operation isperformed using the completion mask. Then in processing block 1568 theiteration count is updated and processing reiterates beginning inprocessing block 1570. It will again be appreciated that while process1503, as illustrated, does not presume that the processed elements needto be stored to memory, any such storing, or scattering to memory,together with additional subsequent iterations of process 1503 may beperformed in accordance with alternative embodiments of the invention.

FIG. 15D illustrates a flow diagram for an alternative embodiment of acombined process 1504 to provide efficient SIMD vector address conflictresolution. In processing block 1505 an offset in each element of afirst register or memory vector source is compared with an offset inevery less significant element of the first vector source to determineif they hold matching offsets. In processing block 1510 mask bits areset to one according to matching offsets in less significant elements,for masks in a first vector destination corresponding to each element ofthe first vector source. In processing block 1515 the number of bits setto one are counted for each element of the first vector destination, andin processing block 1520 the counts are stored in a second vectordestination. In processing block 1526 the counts in the seconddestination register are compared, each with a corresponding value in asecond vector source, in order to determine the corresponding elementsin a third vector source on which to perform a SIMD operation. Thecomparison results are stored in processing block 1531 as mask values ina first vector mask destination. In processing block 1533 adetermination is made whether or not there are dependencies in the SIMDoperation. If not processing may proceed directly to processing block1553. Otherwise processing proceeds first to processing block 1535 wherethe number of most significant contiguous bits set to zero are countedfor each element of the first vector destination. In processing block1540 each count is stored as a value in a corresponding data field of athird vector destination. In processing block 1545 the counts of each ofthe data fields in the third vector destination register are subtractedfrom a corresponding value, one less than the number of bits used tostore the elements in the first vector destination to generate acorresponding difference. In processing block 1550 each of thecorresponding differences is stored as a permute control value in acorresponding data field of a fourth vector destination.

Then in processing block 1553 elements are gathered from memory or cacheinto the third vector source using the offsets in the first vectorsource and the first vector mask destination as a completion mask. Inprocessing block 1566 one or more SIMD operations are performed on theelements of the third vector source using the first vector maskdestination as a completion mask. A determination is made in processingblock 1567 whether or not processing of all the data elements isfinished. If so in processing block 1590 the data elements of the thirdvector source are scattered back to memory or cache using the offsets inthe first vector source, and processing of these elements ends inprocessing block 1599.

Otherwise, in processing block 1568 the iteration count is updated. Thenin processing block 1571 the counts in the second vector destination arecompared, each with the iteration count to determine the elements onwhich to operate next. In processing block 1576 the comparison resultsare stored as mask values in the first mask destination completion mask.In processing block 1581 elements in the third vector source arepermuted using permute controls in the fourth vector destination and thefirst mask destination completion mask. Then in processing block 1585the counts in the second vector destination are compared to theiteration count to determine if this iteration can be identified as thelast iteration. Processing then reiterates beginning in processing block1566. Thus the combination of instructions and logic disclosed hereinprovide for more efficient SIMD address conflict resolution especiallyin certain gather-modify-scatter applications.

FIG. 16 illustrates an embodiment of an apparatus 1601 for executing aninstruction to provide SIMD vector leading zero count functionalityuseful for generating permute controls for efficient vector addressconflict resolution. Embodiments of apparatus 1601 may be part of apipeline 400 (e.g. execution stage 416) or part of a core 490 (e.g.execution unit(s) 462) for execution of an instruction to provide SIMDvector leading zero count functionality. Embodiments of apparatus 1601may be coupled with a decode stage (e.g. decode 406) or a decoder (e.g.decode unit 440) to decode an instruction for a SIMD vector leading zerocount, which may permit efficient vector address conflict resolution.One or more execution units (e.g. execution apparatus 1601) responsiveto the decoded instruction, read the plurality of bits of each of thedata fields in memory vector operand or vector register 1610 or 1620,and for each data field of the memory vector operand or vector register1610 or 1620, count the number of most significant contiguous bits setto zero, and store the count as a value in a corresponding data field ofa SIMD destination register 1650 or 1660.

For example, embodiments of apparatus 1601 may be coupled with vectorregisters (e.g. physical register files unit(s) 458) comprising avariable plurality of n variable sized data fields to store values of avariable plurality of n variable sized data elements. Embodiments of theinstruction to provide SIMD vector leading zero count functionalityspecify a vector leading zero count operation and a data field size forperforming the SIMD leading zero count for each data field of the memoryvector operand or vector register, e.g. 1610 or 1620, and storing thecounts as values in corresponding data fields of the specified size inthe SIMD destination register, e.g. 1650 or 1660.

For example, one embodiment of apparatus 1601 for executing aninstruction to provide SIMD vector leading zero count functionalityreads the plurality of bits of each of the data fields of a first size(e.g. 16-bits or 32-bits) in memory vector operand or vector register1620, and counts the number of most significant contiguous bits set tozero in leading zero counters 1630-1637 of a leading zero count circuit1603, then stores the counts as values in corresponding data fields ofthe same specified size in the SIMD destination register 1660. Anotherembodiment of apparatus 1601 for executing an instruction to provide aSIMD vector leading zero count reads the plurality of bits of each ofthe data fields of a second size (e.g. 32-bits or 64-bits) in a memoryvector operand or vector register 1610, and selects the counts of themost significant contiguous bits set to zero from odd leading zerocounters 1631 to 1637, or adds a value m to the counts from even leadingzero counters 1630 to 1636, respectively, in selective adder circuits1640 to 1643 of a leading zero count combination circuit 1604, thenstores the combined counts as values in corresponding data fields of thespecified size in the SIMD destination register 1650. It will beappreciated that alternative embodiments of apparatus 1601 for executingan instruction to provide SIMD vector leading zero counts may be capableof performing both SIMD vector leading zero counts of a first data fieldsize and SIMD vector leading zero counts of a second data field size asshown in FIG. 16, or may be modified to perform SIMD vector leading zerocounts for a variety of specified data field sizes. SIMD vector leadingzero count instructions, as in the embodiments described herein, may beused with variable sized elements and conflict masks to provide SIMDpermute controls, thereby permitting more efficient SIMD addressconflict resolution in registers without performing dependentcomputations through memory. Thus the SIMD vector leading zero countinstructions and logic disclosed herein provide for more efficient SIMDaddress conflict resolution especially in certain gather-modify-scatterapplications, for example as discussed with regard to FIGS. 14A and 14D.

FIG. 17 illustrates an embodiment of an apparatus 1701 for executing aninstruction to provide SIMD vector address conflict detectionfunctionality for efficient vector address conflict resolution.Embodiments of apparatus 1701 may also be part of a pipeline 400 (e.g.execution stage 416) or part of a core 490 (e.g. execution unit(s) 462)for execution of an instruction to provide SIMD vector address conflictdetection functionality. Embodiments of apparatus 1701 may be coupledwith a decode stage (e.g. decode 406) or a decoder (e.g. decode unit440) to decode an instruction for a SIMD vector address conflictdetection, which may permit efficient vector address conflictresolution. One or more execution units (e.g. execution apparatus 1701)responsive to the decoded instruction, read the values of each of thedata fields in memory vector operand or vector register 1710 or 1720,and for each data field of the memory vector operand or vector register1710 or 1720, compares its corresponding offset with every lesssignificant data field of the memory vector operand or vector registerto determine if they hold matching offsets. Then for each data field ina SIMD destination register 1750 or 1760 corresponding to an offset inthe memory vector operand or vector register 1710 or 1720, executionapparatus 1701 sets (e.g. to one) any mask bits corresponding to lesssignificant data fields holding a matching, and set any other bits inthe SIMD destination register 1750 or 1760 to a different value (e.g.like zero).

For example, embodiments of apparatus 1701 may be coupled with vectorregisters (e.g. physical register files unit(s) 458) comprising avariable plurality of n variable sized data fields to store values of avariable plurality of n variable sized data elements. Embodiments of theinstruction to provide SIMD vector address conflict detectionfunctionality specify a vector address conflict detection operation anda data field size for performing the SIMD address conflict detection foreach data field of the memory vector operand or vector register, e.g.1710 or 1720, and storing the conflict masks in corresponding datafields of the specified size in the SIMD destination register, e.g. 1750or 1760.

For example, one embodiment of apparatus 1701 for executing aninstruction to provide SIMD vector address conflict detectionfunctionality reads the values of each of the data fields of a firstsize (e.g. 16-bits or 32-bits) in memory vector operand or vectorregister 1720, and compares its corresponding offset with the offset inevery less significant data field for equality using equalitycomparators, e.g. equality comparators 1730-1736, of an address conflictdetection circuit 1703, then stores the conflict masks in correspondingdata fields of the same specified size in the SIMD destination register1760. Another embodiment of apparatus 1701 for executing an instructionto provide a SIMD vector address conflict detection reads the values ofeach of the data fields of a second size (e.g. 32-bits or 64-bits) in amemory vector operand or vector register 1610, and combines (e.g. ANDstogether) comparisons of corresponding adjacent data subfields, e.g.from equality comparators 1732 and 1733, 1730 and 1736, 1734 and 1735,etc., respectively, in AND logic 1740 to 1742 of a conflict combinationcircuit 1704, then stores the combined conflict masks in correspondingdata fields of the specified size in the SIMD destination register 1750.It will be appreciated that alternative embodiments of apparatus 1701for executing an instruction to provide SIMD vector address conflictdetection may be capable of performing both SIMD vector address conflictdetection of a first data field size and SIMD vector address conflictdetection of a second data field size as shown in FIG. 17, or may bemodified to perform SIMD vector address conflict detection for a varietyof specified data field sizes. It will be appreciated that SIMD vectoraddress conflict detection instructions, as in the embodiments describedherein, may be used for variable sized elements and memory offsets toprovide SIMD vector address conflict detection functionality and togenerate conflict masks for efficient SIMD address conflict resolution.It will also be appreciated that SIMD vector address conflict detectioninstructions may be used in combination with SIMD vector leading zerocount instructions, as in the embodiments described herein, to provideSIMD permute controls, for more efficient SIMD address conflictresolution especially in certain gather-modify-scatter applications, forexample as discussed with regard to FIGS. 14A, 14B and 14D.

FIG. 18 illustrates an embodiment of an apparatus 1801 for executing aninstruction to provide SIMD vector population count functionality forefficient vector address conflict resolution. Embodiments of apparatus1801 may be part of a pipeline 400 (e.g. execution stage 416) or part ofa core 490 (e.g. execution unit(s) 462) for execution of an instructionto provide SIMD population count functionality. Embodiments of apparatus1801 may be coupled with a decode stage (e.g. decode 406) or a decoder(e.g. decode unit 440) to decode an instruction for a SIMD populationcount, which may permit efficient vector address conflict resolution.One or more execution units (e.g. execution apparatus 1801) responsiveto the decoded instruction, read the plurality of bits of each of thedata fields in memory vector operand or vector register 1810 or 1820,and for each data field of the memory vector operand or vector register1810 or 1820, count the number of bits set to one, and store the countas a value in a corresponding data field of a SIMD destination register1850 or 1860.

For example, embodiments of apparatus 1801 may be coupled with vectorregisters (e.g. physical register files unit(s) 458) comprising avariable plurality of n variable sized data fields to store values of avariable plurality of n variable sized data elements. Embodiments of theinstruction to provide SIMD population count functionality specify avector population count operation and a data field size for performingthe SIMD population count for each data field of the memory vectoroperand or vector register, e.g. 1810 or 1820, and storing the counts asvalues in corresponding data fields of the specified size in the SIMDdestination register, e.g. 1850 or 1860.

For example, one embodiment of apparatus 1801 for executing aninstruction to provide SIMD vector population count functionality readsthe plurality of bits of each of the data fields of a first size (e.g.16-bits or 32-bits) in memory vector operand or vector register 1820,and counts the number of bits set to one in population counters1830-1837 of a population count circuit 1803, then stores the counts asvalues in corresponding data fields of the same specified size in theSIMD destination register 1860. Another embodiment of apparatus 1801 forexecuting an instruction to provide a SIMD vector population count readsthe plurality of bits of each of the data fields of a second size (e.g.32-bits or 64-bits) in a memory vector operand or vector register 1810,and adds the counts of the bits set to one from population counters1830-1831, to 1836-1837, respectively, in adders 1840 to 1845 of apopulation count combination circuit 1804, then stores the combinedcounts as values in corresponding data fields of the specified size inthe SIMD destination register 1850. It will be appreciated thatalternative embodiments of apparatus 1801 for executing an instructionto provide SIMD vector population counts may be capable of performingboth SIMD vector population counts of a first data field size and SIMDvector population counts of a second data field size as shown in FIG.18, or may be modified to perform SIMD vector population counts for avariety of specified data field sizes. SIMD vector population countinstructions, as in the embodiments described herein, may be used withvariable sized elements and conflict masks to efficiently computeiteration counts and to provide SIMD completion masks for iterations ofa SIMD address conflict resolution. Thus the combination of instructionsand logic disclosed herein provide for more efficient SIMD addressconflict resolution especially in certain gather-modify-scatterapplications, for example as discussed with regard to FIGS. 14A-14D.

Embodiments of the mechanisms disclosed herein may be implemented inhardware, software, firmware, or a combination of such implementationapproaches. Embodiments of the invention may be implemented as computerprograms or program code executing on programmable systems comprising atleast one processor, a storage system (including volatile andnon-volatile memory and/or storage elements), at least one input device,and at least one output device.

Program code may be applied to input instructions to perform thefunctions described herein and generate output information. The outputinformation may be applied to one or more output devices, in knownfashion. For purposes of this application, a processing system includesany system that has a processor, such as, for example; a digital signalprocessor (DSP), a microcontroller, an application specific integratedcircuit (ASIC), or a microprocessor.

The program code may be implemented in a high level procedural or objectoriented programming language to communicate with a processing system.The program code may also be implemented in assembly or machinelanguage, if desired. In fact, the mechanisms described herein are notlimited in scope to any particular programming language. In any case,the language may be a compiled or interpreted language.

One or more aspects of at least one embodiment may be implemented byrepresentative instructions stored on a machine-readable medium whichrepresents various logic within the processor, which when read by amachine causes the machine to fabricate logic to perform the techniquesdescribed herein. Such representations, known as “IP cores” may bestored on a tangible, machine readable medium and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor.

Such machine-readable storage media may include, without limitation,non-transitory, tangible arrangements of articles manufactured or formedby a machine or device, including storage media such as hard disks, anyother type of disk including floppy disks, optical disks, compact diskread-only memories (CD-ROMs), compact disk rewritable's (CD-RWs), andmagneto-optical disks, semiconductor devices such as read-only memories(ROMs), random access memories (RAMs) such as dynamic random accessmemories (DRAMs), static random access memories (SRAMs), erasableprogrammable read-only memories (EPROMs), flash memories, electricallyerasable programmable read-only memories (EEPROMs), magnetic or opticalcards, or any other type of media suitable for storing electronicinstructions.

Accordingly, embodiments of the invention also include non-transitory,tangible machine-readable media containing instructions or containingdesign data, such as Hardware Description Language (HDL), which definesstructures, circuits, apparatuses, processors and/or system featuresdescribed herein. Such embodiments may also be referred to as programproducts.

In some cases, an instruction converter may be used to convert aninstruction from a source instruction set to a target instruction set.For example, the instruction converter may translate (e.g., using staticbinary translation, dynamic binary translation including dynamiccompilation), morph, emulate, or otherwise convert an instruction to oneor more other instructions to be processed by the core. The instructionconverter may be implemented in software, hardware, firmware, or acombination thereof. The instruction converter may be on processor, offprocessor, or part on and part off processor.

Thus, techniques for performing one or more instructions according to atleast one embodiment are disclosed. While certain exemplary embodimentshave been described and shown in the accompanying drawings, it is to beunderstood that such embodiments are merely illustrative of and notrestrictive on the broad invention, and that this invention not belimited to the specific constructions and arrangements shown anddescribed, since various other modifications may occur to thoseordinarily skilled in the art upon studying this disclosure. In an areaof technology such as this, where growth is fast and furtheradvancements are not easily foreseen, the disclosed embodiments may bereadily modifiable in arrangement and detail as facilitated by enablingtechnological advancements without departing from the principles of thepresent disclosure or the scope of the accompanying claims.

What is claimed is:
 1. A processor comprising: a first registercomprising a first plurality of data fields, wherein each of the firstplurality of data fields in the first register is to store a secondplurality of bits; a first destination register comprising a thirdplurality of data fields corresponding to the first plurality of datafields, wherein each of the third plurality of data fields in the firstdestination register is to store a count of a number of most significantcontiguous bits set to zero for a corresponding data field of the firstplurality of data fields; a decode stage to decode a first instructionspecifying a vector leading zero count operation; and one or moreexecution units, responsive to the decoded first instruction, to: readthe values of each of the data fields in the first register; for eachdata field of the first plurality of data fields in the first register,count the number of most significant contiguous bits set to zero, andstore the count as a value in a corresponding data field of the thirdplurality of data fields in the first destination register.
 2. Theprocessor of claim 1, further comprising: a second register comprising afourth plurality of data fields corresponding to the third plurality ofdata fields, wherein each of the fourth plurality of data fields is tostore a value of one less than a number of bits in the second pluralityof bits a second destination register comprising a fifth plurality ofdata fields corresponding to the third plurality of data fields; saiddecode stage to decode a second instruction specifying a vector subtractoperation; and the one or more execution units, responsive to thedecoded second instruction, to: subtract the value of each of the datafields in the first destination register from a corresponding value ofeach of the data fields in the second register to generate acorresponding difference, and store each of the correspondingdifferences as a value in a corresponding data field of the fifthplurality of data fields in the second destination register.
 3. Theprocessor of claim 2, further comprising: a third register comprising asixth plurality of data fields corresponding to the fifth plurality ofdata fields, wherein each of the sixth plurality of data fields is tostore a copy of a specific value; a third destination registercomprising a seventh plurality of mask fields, a portion of the seventhplurality of mask fields corresponding to the fifth plurality of datafields; said decode stage to decode a third instruction specifying avector comparison operation; and the one or more execution units,responsive to the decoded second instruction, to: compare the value ofeach of the data fields in the second destination register with acorresponding value of each of the data fields in the third register togenerate a corresponding mask value, and store each of the correspondingmask values in a corresponding mask field of the seventh plurality ofmask fields in the third destination register.
 4. The processor of claim3, wherein the specific value is a value of negative one.
 5. Theprocessor of claim 4, wherein the vector comparison operation is avector equality comparison operation.
 6. The processor of claim 4,wherein the vector comparison operation is a vector greater-thancomparison operation.
 7. The processor of claim 1, wherein the firstinstruction is a vector leading zero count instruction used at least inpart, to generate a set of permute controls in the second destinationregister, and a completion mask in the third destination register to beused with the set of permute controls.
 8. The processor of claim 7,wherein the value of one less than a number of bits in the secondplurality of bits is thirty-one.
 9. The processor of claim 7, whereinthe value of one less than a number of bits in the second plurality ofbits is sixty-three.
 10. A method comprising: storing in each of a firstportion of a plurality of m data fields of a first vector register, asecond plurality of bits; executing, in a processor, a SIMD instructionfor a vector leading zero count; and for each data field of the portionof plurality of m data fields in the first vector register, counting thenumber of most significant contiguous bits of the second plurality ofbits that are set to zero, and storing the count as a value in acorresponding data field of a third plurality of data fields in a firstvector destination register.
 11. The method of claim 10, furthercomprising: storing in each of a second portion of a plurality of m datafields of a second vector register, a value of one less than a number ofbits in the second plurality of bits; executing, in the processor, aSIMD instruction for a vector subtraction; and subtracting the value ofeach of the data fields in the first vector destination register from acorresponding value of each of the data fields in the second vectorregister to generate a corresponding difference, and storing each of thecorresponding differences as a value in a corresponding data field of aplurality of n data fields of a second vector destination register. 12.The method of claim 11, further comprising: storing in each of a thirdportion of a plurality of m data fields of a third vector register, acopy of a specific value; executing, in the processor, a SIMDinstruction for a vector comparison; and comparing the value of each ofthe data fields in the second vector destination register with acorresponding value of each of the data fields in the third vectorregister to generate a corresponding mask value, and storing each of thecorresponding mask values in a corresponding mask field of a pluralityof n mask fields of a mask destination register.
 13. The method of claim12, wherein the specific value is a value of negative one.
 14. Themethod of claim 13, wherein the vector comparison operation is a vectorequality comparison operation.
 15. The method of claim 13, wherein thevector comparison operation is a vector greater-than comparisonoperation.
 16. The method of claim 10, wherein the first instruction isa vector leading zero count instruction used at least in part, togenerate a set of permute controls in the second vector destinationregister, and a completion mask in the mask destination register to beused with the set of permute controls.
 17. A machine-readable medium torecord functional descriptive material including one or more executableinstructions, which if executed on behalf of a thread of a machinecauses the machine to: count the number of most significant contiguousbits of a second plurality of bits that are set to zero for each datafield of a first plurality of data fields in a first vector register,and store each count as a value in a corresponding data field of a thirdplurality of data fields in a first vector destination register;subtract the value of each of the data fields in the first vectordestination register from a corresponding value, one less than thenumber of bits in the second plurality of bits, in each data field in asecond vector register to generate a corresponding difference, and storeeach of the corresponding differences as a value in a corresponding datafield of a fourth plurality of data fields of a second vectordestination register; and compare the value of each of the data fieldsin the second vector destination register with a corresponding copy of aspecific value in each of the data fields in a third vector register togenerate a corresponding mask value, and store each of the correspondingmask values in a corresponding mask field of a plurality of n maskfields of a mask destination register.
 18. The machine-readable mediumof claim 17, wherein a first instruction one or more executableinstructions is a vector leading zero count instruction used at least inpart, to generate a set of permute controls in the second vectordestination register, and a completion mask in the mask destinationregister to be used with the set of permute controls.
 19. Themachine-readable medium of claim 17, wherein the specific value is avalue of negative one.
 20. The machine-readable medium of claim 17,wherein the vector comparison operation is a vector equality comparisonoperation.
 21. The machine-readable medium of claim 17, wherein thevector comparison operation is a vector greater-than comparisonoperation.
 22. A processing system comprising: a memory; and a pluralityof processors each processor comprising: a first register comprising afirst plurality of data fields, wherein each of the first plurality ofdata fields in the first register is to store a second plurality ofbits; a first destination register comprising a third plurality of datafields corresponding to the first plurality of data fields, wherein eachof the third plurality of data fields in the first destination registeris to store a count of a number of most significant contiguous bits setto zero for a corresponding data field of the first plurality of datafields; a decode stage to decode a first instruction specifying a vectorleading zero count operation; and one or more execution units,responsive to the decoded first instruction, to: read the values of eachof the data fields in the first register; for each data field of thefirst plurality of data fields in the first register, count the numberof most significant contiguous bits set to zero, and store the count asa value in a corresponding data field of the third plurality of datafields in the first destination register.
 23. The processing system ofclaim 22, each processor further comprising: a second registercomprising a fourth plurality of data fields corresponding to the thirdplurality of data fields, wherein each of the fourth plurality of datafields is to store a value of one less than a number of bits in thesecond plurality of bits a second destination register comprising afifth plurality of data fields corresponding to the third plurality ofdata fields; said decode stage to decode a second instruction specifyinga vector subtract operation; and the one or more execution units,responsive to the decoded second instruction, to: subtract the value ofeach of the data fields in the first destination register from acorresponding value of each of the data fields in the second register togenerate a corresponding difference, and store each of the correspondingdifferences as a value in a corresponding data field of the fifthplurality of data fields in the second destination register.
 24. Theprocessing system of claim 23, each processor further comprising: athird register comprising a sixth plurality of data fields correspondingto the fifth plurality of data fields, wherein each of the sixthplurality of data fields is to store a copy of a specific value; a thirddestination register comprising a seventh plurality of mask fields, aportion of the seventh plurality of mask fields corresponding to thefifth plurality of data fields; said decode stage to decode a thirdinstruction specifying a vector comparison operation; and the one ormore execution units, responsive to the decoded second instruction, to:compare the value of each of the data fields in the second destinationregister with a corresponding value of each of the data fields in thethird register to generate a corresponding mask value, and store each ofthe corresponding mask values in a corresponding mask field of theseventh plurality of mask fields in the third destination register. 25.The processing system of claim 24, wherein the first instruction is avector leading zero count instruction used at least in part, to generatea set of permute controls in the second destination register, and acompletion mask in the third destination register to be used with theset of permute controls.
 26. The processing system of claim 24, whereinthe specific value is a value of negative one.
 27. The processing systemof claim 26, wherein the vector comparison operation is a vectorequality comparison operation.
 28. The processing system of claim 26,wherein the vector comparison operation is a vector greater-thancomparison operation.